the C language, BP artificial intelligence algorithms can be seen teaching

地球模拟器，最经典的人工生命模型,研究人工智能的必看。一般地说，生命都具有新陈代谢、复制和进化的能力。在自然界中，生物是由有限的食物供给和有限的生存空间约束的。在Tierra中，“生物”由一系列能够自我复制的机器代码或程序组成，它在计算机中的复制分别受到计算机的存储空间和CPU时间约束。能有效地占有内存空间和利用CPU时间的生物体，将具有更高的适应度，传递到下一代的机会就越大。 在Tierra中，计算机的RAM（随机访问存储器）中有一块专门的空间，这个空间中放置了一个“祖先有机体”，该祖先有机体根据它的汇编程序代码中的指令开始复制对它的生存是基本的代码。随着有机体的数目的增加，RAM中的空间减少了，因此有机体为了自己的生存空间开始竞争。-Earth Simulator, the most classic of artificial life model, the study of artificial intelligence Watchable. Generally speaking, life is metabolism, reproduction and the ability of evolution. In nature, biomass is limited by the supply of food and limited living space constraints. In Tierra, "biological" to a series of self-replicating machine code or procedure, in which computers were copied by the computer storage space and CPU time constraints. Effective occupy memory space and CPU time using the organisms, will have a higher degree of adaptability, conveying to the next generation the greater the chances. In Tierra, computer RAM (random access memory) is

本程序是人工编写的bp神经网络，针对识别样本btw三类进行训练和识别。-This procedure is prepared bp artificial neural networks, btw samples for identification of three types of training and identification.

自主式决策树学习的程序源码，对研究机器学习的同行很有用。-Autonomous Decision Tree learning procedures source, the study machine learning peer useful.

ID3算法的另一种用java实现的代码，利用向量。-Another ID3 algorithm realize with java code, using vector.

ｍａｔｌａｂ编写的计算排序问题或者求最优值问题，适用于数学建模以及工程计算-Matlab calculations prepared by the scheduling problem or seek optimal values, apply to mathematical modeling, and engineering computing

标准遗传算法程序，包含详细的问题描述，如果想和大家讨论的话。

简单遗传算法经典例子！！ SGPC: Simple Genetic Programming in C by Walter Alden Tackett and Aviram Carmi-simple genetic algorithm classic example! ! SGPC : Simple Genetic Programming in C by Walter Alden Tackett and Aviram Carmi

java神经网络工具箱-neural network toolbox

通俗的介绍了RVM与SVM的区别,写的非常通俗易懂-Tutorial of RVM

Aprior算法实现程序-Aprior algorithm program! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! !