人工智能经典问题TSP问题的Java实现，内含源程序和调试过程生成的文件...

pso优化算法的vc++源程序。在vc.net2003下面通过。 建议：看代码之前，请先弄明白pso是怎么回事。然后请对应着来：程序中用Agent代表一只鸟，PSO代表鸟群。阅读源代码，不要顺着看，先看main(),然后按照出现的东西的顺序，一个一个得来。-PSO optimization algorithm vc++ source. In the following vc.net2003 through. Recommendations: look the code before you find out how the PSO story. Then corresponds to: Program with Agent on behalf of a bird, PSO representative of birds. Read the source code, do not look down, look at the main (), then follow the order of things emerging, one by one come.

kmeans分类的小程序，聚类算法，大家都来看看吧，-kmeans classification of small procedures, clustering algorithm, as we all look at and see,

pazen window分类器， 在模式识别课学到的，自己写的一个小程序-pazen window classifier, pattern recognition lesson learned, to write a small program

灰度变换的实例程序，其中的CDib类可以直接应用于其他的图像处理程序。-gray transform examples procedures, which the CDib categories can be directly applied to other image processing.

堆排序适合于待排序文件中记录较多的情况，因为其主要的时间开销在于建堆和调整堆-HEAPSORT be suitable for sorting paper records more, because the main overhead is the time to build reactors and adjusting the heap

自适应遗传算法matlab代码.自适应遗传算法的问题是很容易早熟,好处就是速度快 .不过我将在其中会引入一个早熟判定标志的，并设定一个阈值，如此以来，就可以防止早熟现象了 -Adaptive genetic algorithm Matlab code. Adaptive genetic algorithm is very easy precocious, advantage is faster. However, in which I will be introducing an early sign of determination, and set a threshold, so, you can prevent precocious phenomenon

一种基于子波特征的模糊神经网络目标识别方法，有一定参考意义-based on wavelet characteristics of the FNN target identification methods, a certain reference value

载入txt文件迷宫，含几种搜索方法，例如depth first search, breadth first search等-maze included txt file containing several search methods, such as depth first search, breadth first search, etc.

f聚类算法 mathematica程序-f clustering algorithm mathematica program

每条人工鱼迭代20次的位置,每条人工鱼迭代20次的位置,对应的Y的值,每条人工鱼迭代20次的临时位置,公告牌,每条人工鱼迭代20次的位置,对应的Y的临时值，公告牌,人工鱼移动的最大步长,求出最优的函数值；-Each of artificial fish, the location of 20 iterations, each iteration of artificial fish, the location of 20 times the corresponding value of Y, each iteration of artificial fish 20 times a temporary location, bulletin boards, each iteration of artificial fish 20 second position, corresponding to the provisional value of Y, bulletin boards, artificial fish, the biggest step to move, find the optimal function value