GA small programs.

使用labview编写的dice游戏，很有趣味性。-prepared by the use of PC dice games, very interesting.

隐马尔科夫模型工具箱，可以广泛应用于识别等领域-HMM Toolbox, can be widely applied in areas such as identification

基于小生境遗传算法的分类规则数据挖掘算法 -Based on Niche Genetic Algorithm for Classification Rules Data Mining Algorithm

人工免疫算法的集合，包含函数优化，图象识别，聚类等多种应用，采用matlab编程，并负有示例数据。~..~ -artificial immune algorithm set includes function optimization, image recognition, clustering, and other applications. using Matlab programming, and bear sample data. ~ ~ ..

经典的SOM人工神经网络例子源码，经测试可用，可作入门学习用-SOM classic examples of artificial neural network source code

最新的支持向量机工具箱，有了它会很方便 1. Find time to write a proper list of things to do! 2. Documentation. 3. Support Vector Regression. 4. Automated model selection. REFERENCES ========== [1] V.N. Vapnik, "The Nature of Statistical Learning Theory", Springer-Verlag, New York, ISBN 0-387-94559-8, 1995. [2] J. C. Platt, "Fast training of support vector machines using sequential minimal optimization", in Advances in Kernel Methods - Support Vector Learning, (Eds) B. Scholkopf, C. Burges, and A. J. Smola, MIT Press, Cambridge, Massachusetts, chapter 12, pp 185-208, 1999. [3] T. Joachims, "Estimating the Generalization Performance of a SVM Efficiently", LS-8 Report 25, Universitat Dortmund, Fachbereich Informatik, 1999. -The newest work tools of svm,it will be very convenient to have it.

这是一个用fortran 实现的BP算法源程序，以及c和 matlab实现BP的源程序。大家可以从各个方面做一个性能的比较-This is a used fortran source realize the BP algorithm, as well as c and matlab realize the source BP. From the U.S. to do all aspects of a performance comparison

人工智能编程示例-artificial intelligence programming paradigm

本程序是使用一种遗传算法解决m个工件分配给m架机床的效益最优化问题，-this program is to use a genetic algorithm to solve m m allocated to the workpiece-machine efficiency optimization,

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.