遗传算法解决NN逼近任意函数

围绕粒子群的当前质心对粒子群重新初始化.这样，每个粒子在随后的迭代中将在新的位置带着粒子在上次搜索中获得的“运动惯性”（wvi）向Pi，Pg的方向前进，从而可以在粒子群的运动过程中获得新的位置，增加求得更优解的机会.随着迭代的继续，经过变异的粒子群又将趋向于同一点，当粒子群收敛到一定程度时又进行下一次变异，如此反复，直到迭代结束.-particle swarm around the center of mass of the current PSO reinitialization. Thus, Each particle in the next iteration will be in the new location with particles in the last search was the "inertia" (wvi ) Pi, Pg orientation, and thus can PSO course of the campaign was a new position, increase seek better solutions opportunities. With the continued iteration, after variation of PSO will tend to the same point. When PSO converge to a certain extent when the next variation, so repeatedly, until the end of iteration.

这是用实验函数--Ackley函数来检验遗传算法的优越性，其中有点小毛病，就是种群数在20个左右效果最好，一旦增加种群，结果就不大对劲了。忙了好多天，也没调出来，还请各位大侠指点喽-This is the experimental function-- Ackley function to test the advantages of genetic algorithm, with a little fault, is the number of stocks in the 20 best around, once increased stocks, the result is not very comfortable having the. Busier afterwards, it was not stressed out, please Shanhaiguan kind Lackeys

A SVM classifier, with detail documents.

粒子群优化算法，挺好，大家可以试试，非常好的优化算法-PSO algorithm, is very good, we could try, very good Optimization Algorithm

研究机器人控制不可多得资料，强烈推荐-robot control study rare, strongly recommended!

基于Web页面的人工智能控件例证 [VB源码]-Web page based on the example of artificial intelligence control [VB code]

一个使用Java实现的人工智能的图搜索策略程序――酒九宫图问题 人工智能－图搜索策略－演示程序－使用说明 程序简介 在人工智能领域，对隐式图的搜索是求解问题的一种基本方法，本程序通过使用多种图搜索策略，对 重排九宫问题进行求解，演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、 “最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。 整个程序使用了动画技术，界面设计美观友好，使用方便。-use a Java artificial intelligence plans Search Strategy-- Liquor JiuGongTu problems of artificial intelligence-map search strategy- Demonstration Program-use guide in the field of artificial intelligence, the implicit search of the plan to solve the problem is one of the basic methods, the procedures through the use of multiple map search strategy, the rearrangement JiuGongTu problem solving, presentation of the "breadth- first search," "depth-first search", "bounded depth-first search", "best-first search" and "partial selection of the best search" five basic map search strategy. The whole process of using animation, interface design aesthetic friendly, easy to use.

TSP算法，应用局部搜索法得到最优路径，已经经过优化。没有密码，可以使用，vc环境下使用。-TSP algorithm, using local search to be optimal path has been optimized. No password can be used, vc environments.

支持向量机源码，vc编写，对于svm初学者非常使用非常方便-The coad of svm,base on vc,and it is useful to beginner.

神 经 网 络 的 资 料-neural network data