遗传算法demo

char *MD5_file (char *path, int md5_len)   {       FILE *fp = fopen (path, "rb");       MD5_CTX mdContext;       int bytes;       unsigned char data[1024];       char *file_md5;       int i;          if (fp == NULL) {           fprintf (stderr, "fopen %s failed ", path);           return NULL;       }          MD5Init (&mdContext);       while ((bytes = fread (data, 1, 1024, fp)) != 0)       {           MD5Update (&mdContext, data, bytes);       }       MD5Final (&mdContext);              file_md5 = (char

first come first serve

逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯―塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯―塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Successive Over Relaxation Me thod, called SOR method) is the Gauss- Seidel method for an accelerated method is solution of large sparse matrix equations, one effective method, it has a simple formula, programming easy, take up less computer memory, etc., but the need for better acceleration factor (that is, the best relaxation factor). Let us first talk about the meaning of the term relaxation, and then use it to explain the Jacobi s iterative method and the Gauss- Seidel iterative method, and finally gives successive over relaxation iterative method of projection formula and the convergence condition.

吉尔法求解一阶微分方程组的算法-Gil Solving equations a band algorithm

在原优化算法的基础上，在MATLAB中编程实现了无序碎片跳跃算法（SFLA）。

快速排序算法,很好用,用c++编,拷贝在文本里,大家可以参考参考哦.-quick sort algorithm is useful, with c writers, copy in the text, one can refer to Reference oh.

数值计算中的Doolittle分解法（含有紧凑方式的解法），是用VC＋＋编写的-numerical calculation of Doolittle decomposition (containing a compact form of solution), VC++ prepared

对于发射接收都为8个通道的MIMO雷达系统，在一定的背景下，目标距离5000米，运动速度100m/s，运用相位编码信号，仿真发射信号、接收信号，进行DBF处理，匹配滤波提取信息后，MTD处理

用labview编写的基于单纯形寻优算法。用来搜索高斯函数的极值点。-prepared using PC-based simplex optimization algorithms. Search Gaussian function to the extreme point.

迪杰斯特拉最短路径算法-Floyd shortest path algorithm