基于遗传算法和神经网络的外星人游戏的vc＋＋实现的程序

本程序利用遗传算法解决一简单的多项式极值问题-This procedure using the genetic algorithm to solve a simple problem of polynomial extremal

遗传算法中的新的多点交叉算法用来优化选择最优值-Genetic algorithm in the new multi-point crossover algorithm

用vc开发的A*寻路算法的dll,可以在其他语言调用，包含了一个vb调用的示例-The dll file of A* road-mapping algorathm,which can be used in other language,including an example of vb.

Dynamic Programming Code for the TSP

Code for Truth Maintenance System in Artificial Intelligence.-Code for Truth Maintenance System in Artificial Intelligence.

MATLAb语言的遗传算法工具箱，比较全。-MATLAb language of genetic algorithm toolbox, the entire comparison.

一个包含丰富内容的流形学习算法工具包，有图形示例文件demo.fig，包括laplacian特征映射算法、流形规则调整、svm分类算法等内容，希望对研究机器学习的朋友有用。-contains a rich content of the manifold learning algorithm tool kit, graphics documents demo.fig example, laplacian features include mapping algorithm manifold rules adjustments svm classification algorithm, want to study machine learning useful friends.

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.

实现了一个简单的花朵进化的模拟过程。 花朵的种群数量是10，共进化了50代。 -The realization of a simple simulation of the evolution of flowers. Flower populations is 10, a total of 50 on behalf of evolution.

模糊pid的一个例子，在Visual c++下通过-An example of fuzzy pid, in the Visual c++ Through