安的java源代码工具包，包括BP，RBF神经网络的分类和k

LM编程算法，在神经网络中有很大应用之处，神经网络源代码,及BP网络训练界面,其中的L-M算法非常实用 -LM programming algorithm, in a large neural network applications, the neural network source code, and the BP network training interface, in which the LM algorithm is very practical

Simon Haykin的 《Neural NetWorks》例子原码，相当经典。相信很有用，特别SVM PCA等-Simon Haykin "Neural NetWorks" examples of the original code, very classic. I believe very useful, especially in such SVM PCA

用于multivariate时间序列分类，利用了weka机器学习系统（本站可下载）-for multivariate time series classification, the use of machine learning system weka (site available for download)

这是cmu大学的一个研究小组编写的神经网络中反向传播算法的源代码，很有参考价值。-This is a university research group to prepare the neural network back-propagation algorithm source code of great reference value.

介绍人工神经网络的模型及其应用。张立明编著，复旦大学出版社出版。-Introduction of artificial neural network model and its application. Edited by Zhang Liming, Fudan University Publishing House.

将遗传算法与蚁群算法相相结合，产生的一种新算法-genetic algorithm and ant algorithm combination of a new algorithm

： 移动机器人路径规划是机器人学的一个重要研究领域。 针对移动场地的特点对其进行了建 模与存储，然后将场地处理成简单的连通图-: Mobile robot path planning is an important study robot research field. Characteristics for mobile sites for their modeling and storage, and then deal with the venue into a simple connected graph

西安交大出版的王小平的遗传算法的书一个简单遗传算法例子 .-Wang Xiaoping published in the book GA GA a simple example.

AI 人工智能 在C#环境下实现 9宫格 算法-AI

禁忌搜索法对初始解、邻域个数及禁忌列表的大小等参数有比较严格的要求, 这些参数直接影响着算法的优化能力。文章提出了一种改进的禁忌搜索法, 它用有效空间来压缩搜索范围, 这样可以提高搜索效率和全局搜索能力。用短期和长期禁忌列表存储器来保证算法能搜索到全和分局空间的每一点, 并且不重复搜索。经过验算析, 证明它是一种较好的全局启发式搜索法.-Tabu search method, the initial solution, neighborhood and tabu list size of the number of parameters such as have more stringent requirements, these parameters directly affect the ability to optimize the algorithm. This paper presents an improved tabu search method, it is used effectively to compress the search space, so that can improve search efficiency and global search capabilities. Short-term and long-term memory tabu list to ensure the algorithm can search the whole and the sub-space, each point, and do not repeat the search. After checking analysis to prove that it is a good global heuristic search method.