This code gets a text file which is output of simple scalar profiling command an...

自己做的程序,可能对你有用-own procedures that may be useful to you

This algorithm was developed by Professor Ronald L. Rivest of MIT and can be found presented in several languages. What I provide to you here is a C++ derivative of the original C implementation of Professor Rivets. The library code itself is platform-independant and has been tested in Redhat Linux. I ve included the sample code and makefile that I used for the Linux test. The demo, however, was written with Visual C++ 6 on a Windows 2000 platform.-This algorithm was developed by Professor Ronald L. Rivest of MIT and can be found presented in several languages. What I provide to you here is a C derivative of the original C implementation of Professor Rivets. The library code itself is platform-independant and has been tested in Redhat Linux. I ve included the sample code and makefile that I used for the Linux test. The demo, however, was written with Visual C 6 on a Windows 2,000 platform.

应用背景In generated networks, selecting one node as source and some nodes as receivers in random (single source multicast network), we make performance test for network coding based multicast route algorithm (we put forward it ourselves, corresponding to high multicast rate and low multicast rate), shortest path distribution tree route algorithm (DIJKSTRA algorithm) and Maximum-rate distribution tree route algorithm (PRIM algorithm), respectively. 关键技术 In this program, two things have been done: (1) generate random topologies (2)performance test。   network coding cap:     5.0000  dijk cap:     5.0000  prim cap:     5.0000  network coding res1:     0.0000--res2:    12.0000  dijk res:    14.0000  prim res:    14.0000  average degree:     2.

BESSEL PROGRAMS IN C/C-Loaded PROGRAMS IN C/C

DOS下时间分辨率精确到毫秒的程序-Source of a millisecond timer in DOS

资源描述离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码离散数学代码

应用背景这是一个正则表达式自动创建的代码在C + +关键技术C + +，有限自动机正则表达式

创建此库是为了给一个真正编码优化使用差分进化的框架。具体而言，本库在德实现共六种方法与最新方法。* 德： 基本差分进化。该算法允许使用 6 不同的变异策略和 3 交叉算子。*： 美国 Rahnamayan，H.Tizhoosh，M.萨拉马，反对基于微分进化，进化计算 12 (1) 上的 IEEE 交易记录 （2008 年） 64-79。* 萨德： A.K.秦、 五、 黄琳、 P.N.Suganthan、 与战略相适应的全局数值优化，进化计算 13 (2) 汇刊的差分进化算法 （2009 年） 398 – 417。* 玉： J.张、 A.C.桑德森，玉： 自适应差分进化与可选的外部归档，进化计算 13 （5） 汇刊 （2009 年） 945 — — 958。* DEGL： S.Das，亚伯拉罕，美国 K.查克拉博蒂、 A.纳尔，使用基于邻域的变异算子，进化计算 13 (3) 汇刊的差分进化 （2009 年） 526 – 553。* SFSLDE： F.内里，V.Tirronen 规模因子局部搜索在微分进化中，模计算 1 (2) (2009) 153-171。此库的目的是让研究人员把重点放在其德，避免多次作出相同的代码为每个德。此库已能够在不同的平台上运行。

这个是c++读取excel 的源代码，可以让大家能简单地使用c++读取excel

这是一个用满二叉树解决皇后问题的算法。-This is a binary tree used for the Queen"s solution algorithm.