多核环境下运行了可满足性分析的工具软件，能够使你充分了解多核编程技术...

Pascal Programs Printed in GENETIC ALGORITHMS IN SEARCH, OPTIMIZATION, AND MACHINE LEARNING by David E. Goldberg -Pascal Programs Printed in GENETIC ALGORITHMS IN SEARCH, OPTIMIZATION, AND MACHINE LEARNING by David E. Goldberg

use genetic ant algorithm to slove TSP problem-use genetic algorithm to slove ant TSP ty B"Tselem,

本书介绍了一些关于机器人的识别技术，值得学习和借鉴，作为基础资料不错-The book introduced a number of robot recognition technology, it is worth to learn from, as a good basis for information

对股票走势的仿真，基于agent的设计思路-The trend of the stock simulation, agent-based design ideas

这个是matlab的BP 神经网络-This is matlab" s BP neural network. . . . . . . . . . . . .

本算法为自适应遗传算法，采用基于排序的选择策略，编码方案为实数编码。能够解决很多优化问题！-The algorithm for the adaptive genetic algorithm, based on the sort of choice strategy, coding schemes for real-coded. Many optimization problems can be solved!

专家浅谈人工智能，doc文档-expert on artificial intelligence, doc file

附加了动量项BP神经网络-Additional items of Momentum BP neural network

人工智能课件，好不容易从老师那里考的，觉得老师讲的还蛮不错的-AI courseware, finally, where the exam from the teacher felt that the teacher talked about quite a good

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.