一个经典的遗传算法的C语言程序包可以直接用于开发…

免疫优化计算、学习与识别,是焦李成著的一本经典书中的源程序,供大家学习!-Immune Optimization calculation, learning and recognition, JIAO Li-cheng book is a classic source book for everyone to learn!

用VISUAL C＋＋编程实现指纹图像的特征提取以及对指纹图像的识别-Utilising VISUAL C++ to make programs, we can get the characters of image and identify the image of finger mark

遗传算法求解TSP问题，内附有遗传算法基本原理，程序已验证-Genetic Algorithm for TSP problem, containing the basic principles of genetic algorithm has the process had been made to verify

K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K－均值聚类的的时间复杂度是n*k*m，其中n为样本数，k为类别数，m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类，寻找最优，列举一遍约66.7天，分成3类，则要约3500万年。针对算法局部最优的缺点，本人正在编制模拟退火程序进行改进。希望及早奉给大家，倾听高手教诲。-K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.

我做的一个用matlab程序编写的BP算法，是是我毕设的一部分，程序运行绝对没有问题，欢迎大家指正。-I do a Matlab programming with the back-propagation algorithm, is part of a complete, running absolutely no problem, we are happy to correct.

模式识别工具包，有很多模式识别的算法，可以在matlab中调用-Pattern recognition tool kit, there are many pattern recognition algorithms, you can call matlab

人工智能神经网络识别 人工智能神经网络识别-Artificial neural network artificial neural network to identify

cost存放了一个强连通图的边权矩阵，作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.

蚂蚁算法的VC代码源，模拟蚂蚁觅食的行走途径，解决最优路径问题。-Ant Algorithm VC source code to simulate the foraging ants to walk way to solve the optimal routing problem.

经典算法clique的java实现-Classical algorithm clique of the java implementation! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! !