on Artificial Intelligence missionaries and Savage on the details, please refer...

exmat - The Expression Template Matrix Library,是矩阵运算模板库-exmat- The Matrix Expression Template Library, yes matrix calculation Template Library

6。《非数值并行算法――遗传算法》，刘勇等着 科学出版社 1995年第一版 本书系统地叙述了非数值并行算法之一的模拟退火算法的基本原理以及最新进展，同时为了便于读者解决实际问题，书中对具体算法的步骤作了详细介绍。本书共分七章，第一章介绍算法的思想、特点。发展过程和前景。第二章介绍算法的基本理论。第三章讨论算法解连续优化问题。第四章利用算法设计和优化神经网络。第五章介绍在组合优化中的应用。第六章介绍应用遗传程序设计解决程序设计自动化问题。第七章对遗传算法和其它适应性算法进行比较。 本书可供高校有关专业的师生、科研人员、工程技术人员阅读参考。-6. "Non- numerical parallel algorithms-- Genetic Algorithm" Liu Yong waiting 520-531 1995 version of the first book to systematically describe the non- numerical parallel algorithms one count of simulated annealing Law and the basic tenets of the latest progress, in order to help readers solve practical problems, book of the specific algorithm steps in detail. The book is divided into seven chapters, the first chapter describes the idea algorithm, characteristics. The development process and prospects. The second chapter describes the basic algorithm theory. The third chapter discusses Algorithm for continuous optimization problems. Chapter IV using the algorithm design and optimization of neural netw

Locally weighted polynomial regression LWPR is a popular instance based al gorithm for learning continuous non linear mappings For more than two or three in puts and for more than a few thousand dat apoints the computational expense of pre dictions is daunting We discuss drawbacks with previous approaches to dealing with this problem

模式识别的基础－－相似度量的介绍，对大家可能有帮助-based pattern recognition-- similar to the measure, we might have to help

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

这是个解决八码问题的程序，是外国人编的，用了图形处理技术，请大家参考-This is a solution of 8 yards procedures, the series is a foreigner, his use of graphics processing technology, please refer to

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.

Fuzzy Rule Base Implementation

采用贝叶斯正则化算法提高 BP 网络的推广能力。我们采用两种训练方法，即 L-M 优化算法（trainlm）-?捎??

一个利用vc编成的倒传递类神经网络内容包含到数层的神经网络编写 使用者可以清楚了解BP- Contains using the vc forming but actually transmission class nerve network content to several nerve networks compiles the user to be allowed clearly to understand BP