用于机器人的识别路程的优化,用与其中，去得很好的结果

这是神经网络和遗传算法想结合的c++程序，希望对需要的朋友 有所帮助。-This is a neural network and genetic algorithm would like to combine c++ Procedures, and they hope to help a friend in need.

该程序是基于BP网络的PID控制系统。系统由两部分构成：经典的PID控制器和神经网络。-that the procedure was based on BP network PID control system. System consists of two parts : the classic PID controller and neural networks.

这是一个我自己编写的JAVA程序，可以运行的。思想是将KMEANS和神经网络结合起来实现模式的分类。-This is a Java program writen by meself which can be run.The chief concept is to combine KMEANS and NN to achieve classification of pattens.

基于GA的BP改进算法，用遗传算法对BP 神经网络算法进行改进试用过 里面有数据是可以使用的-GA-based improvement of BP algorithm, genetic algorithm with BP neural network algorithm tried there are data that can be used

HTK系列的，0.98参考资料，应该挺有用的，大家自己看看吧！-HTK Series, 0.98 Reference should be quite useless, we all see!

采用的是康力山等人确定的实验参数。 对于n个城市的旅行商问题，其参数如下： 初始温度：t0=280, 每一个温度下采用固定的迭代次数L=100n, 温度的衰减系数alpha=0.92 算法停止的准则是当相邻两个温度得到的解变化很小时算法停止。-used the Stanozolol Hill were determined by the experimental parameters. N cities for the traveling salesman problem, the parameters are as follows : initial temperature : t0 = 280, each a fixed temperature of the iteration number L = 100n, temperature attenuation coefficient alpha = 0.92 algorithm to stop the criteria when two adjacent the temperature change was very Solution Algorithm stop.

这是一个人工智能方面专家系统的例子，建立动物识别专家系统的规则库，并用与/或图来描述这个规则库。-This is an area of artificial intelligence expert system for example, the establishment of animal recognition expert system rule base and used and/or graph to describe the rule base.

模式识别与人工智能，圆检测HOUGH变换的改进算法-Pattern Recognition and Artificial Intelligence, HOUGH transform circle detection algorithm to improve

实现了二维数据的K均值算法以及ISODATA分类算法-Achieve a two-dimensional data, as well as K-means algorithm ISODATA classification algorithm

用遗传算法求解背包问题是南京航空航天大学信息与计算科学专业编写的.本程序利用遗传算法来求解背包问题.采用二进制字符串编码,1表示选择物体,0则不选择. 背包问题描述:在M件物品取出若干件放在空间为W的背包里，每件物品的重量为W1，W・2……Wn，与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。注意：在本题中，所有的重量值均为整数。-genetic algorithm knapsack problem is the Nanjing University of Aeronautics and Astronautics, Information and Computing Science prepared. The procedure the use of genetic algorithms to solve knapsack problem. binary string encoding, an option objects, 0 no choice. Knapsack Problem Description : M items removed several pieces on the space-W backpack, Each of the weight W1, W 2 ... Wn, the corresponding value of P1, P2 ... Pn. Sought to gain maximum value of the program. NOTE : In this issue, all the weight values are integers.