简单的遗传算法，用于反演

围绕粒子群的当前质心对粒子群重新初始化.这样，每个粒子在随后的迭代中将在新的位置带着粒子在上次搜索中获得的“运动惯性”（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.

模式识别中的十大经典算法,有详细的实现过程,花了很大工夫,现挥泪上传-Ten classic pattern recognition algorithms in detail the realization of the process and spent a lot of work, it is挥泪From

网上一直没有Harris算法的VC程序 无奈 自己写一个吧 用了两个小时就写好了 非常简陋 大家凑合着看 2005年11月15日-Harris algorithm VC procedures helpless himself wrote it with a two hour written a very simple you can make do with a November 15, 2005

神经网络模式识别及其实现，第八章。 内含：KMEANS 、KOHONEN 、LVQ 、SOFM 算法。-pattern recognition and neural network to achieve, Chapter VIII. Intron : KMEANS, KOHONEN, LVQ, SOFM algorithm.

use swarm intelligence to simulate network routings in omnet-use swarm intelligence to simulate networ k routings in omnet

多目标跟踪 (三维)-算法matlab编制-multi-target tracking (3D)- preparation algorithm Matlab

neural network in Java

tsp问题，10个城市的最佳路径。。。。。。matlab-tsp problem, the best 10 cities in the path. . . . . . matlab

通用的蚁群算法，这个算法可以高效地解决tsp问题-Common ant colony algorithm, this algorithm can efficiently solve the problem tsp