完成基于遗传算法的图像模式识别功能流程描述

该文档是清华大学的模式识别教程，该版本是网页版本，浏览非常方便，内容也非常详细，非常适合初学者，个人举得特别是支持向量机那一章描述很棒！-this document is from Tsinghua University,this is the html version,it is convenient to read, it is very suitable for the elementary readers,in my own opinion,the charter of svm is very detail and easily understandable.

使用蚁群算法解决旅行商问题，mfc应用程序，城市数目及坐标在eil51.tsp里-use ant algorithm to solve the traveling salesman problem, and mfc applications, The number of cities and coordinates the eil51.tsp Lane

求图中的祖先节点(不含父亲节点) 内含说明，学图论或人工智能的朋友会用到的。希望有利于理解书上的论述。-plans for their ancestral nodes (excluding the father nodes) intron show that studying graph theory in artificial intelligence or a friend will use the. Hope to understand book expositions.

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

这是关于人工神经网络的c算法实现，对于算法研究比较有用！-C++ implementation of class network By Luca Cinti and Lorenzo Masetti, based on lightweight neural net library written in C by Peter van Rossum.

PR development 2007 模式识别研究进展2007 -PR development 2007 Progress in Pattern Recognition, 2007

基于粒子滤波原理，选取纹理特征对目标进行描述，实现视频目标的跟踪。-Principle-based particle filter, select the texture features to describe on the target to achieve the objectives of tracking video.

一个很好的bp神经网络预测程序实例，有较好的预测精确性-Bp a good example of neural network forecasting process, a better prediction accuracy

MATLAB编写的粒子群优化算法,好用！-MATLAB prepared particle swarm optimization algorithm, easy to use!

一个使用Java实现的人工智能的图搜索策略程序――酒九宫图问题 人工智能－图搜索策略－演示程序－使用说明 程序简介 在人工智能领域，对隐式图的搜索是求解问题的一种基本方法，本程序通过使用多种图搜索策略，对 重排九宫问题进行求解，演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、 “最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。 整个程序使用了动画技术，界面设计美观友好，使用方便。-use a Java artificial intelligence plans Search Strategy-- Liquor JiuGongTu problems of artificial intelligence-map search strategy- Demonstration Program-use guide in the field of artificial intelligence, the implicit search of the plan to solve the problem is one of the basic methods, the procedures through the use of multiple map search strategy, the rearrangement JiuGongTu problem solving, presentation of the "breadth- first search," "depth-first search", "bounded depth-first search", "best-first search" and "partial selection of the best search" five basic map search strategy. The whole process of using animation, interface design aesthetic friendly, easy to use.