一个聚类算法，这是清华大学电子系OCR实验室的人写的

java extreme programming cookbook

一个蚁群算法，大家很想要得东东，共享给大家了。-an ant colony algorithm, we want to fine Eastern, we had to share.

关于演化算法的小程序.以一个二元二次方程的求极值为例.对输入参数作了简化的固定处理.较好的说明了演化算法.可直接运行.-on evolutionary algorithm small procedures. A binary quadratic equation for the extreme example. To simplify the input parameters fixed address. A good note evolutionary algorithm. Direct operation.

Visual studio 2005,C#开发 具有人工智能，可采用人工下棋、电脑参谋、电脑下棋等模式参加互联网比赛。采用ClickOnce发 -Visual studio 2005, C# Development of artificial intelligence, to be used in artificial playing chess, computer staff, the computer model of chess and other games take part in the Internet. Using ClickOnce fat

张文修老师主编的详细介绍遗传算法及其数学基础的一本书，研究遗传算法的一本很好的参考书，特别推荐！-Edited by Prof. Zhang Wenxiu, detailed genetic algorithm and its mathematical foundations, a very good reference book to study the genetic algorithm, strongly recommended!

A star 算法类的实现(算法接口，针对迷宫问题设计)-algorithm to achieve the category (algorithm interface design issues against maze)

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.

一种支持向量机多专家决策算法，很有参考价值-a support vector machine algorithm experts, great reference value

其中包括模拟退火算法的具体实现，还有其他经典算法的实现，数模全赛逢山开路问题的解答程序-Including simulated annealing algorithm to achieve the specific, there are other classical algorithm for the realization of digital-analog-wide open tournament every hill questions procedure

一个简单的HOPFIELD神经网络C语言源代码，其中RELESDE为可执行文件-a simple Hopfield neural network C language source code, which RELESDE executable