HOPFIELD的一个经典用例，解决TSP问题，代码完整，是我自己编写的哦...

SCS-C is another port to C of Goldberg s Simple Classifier System, with a few extensions.-SCS-C is another port to C of Goldberg s Simple Classifier System, with a few extensions.

用遗传算法求解背包问题是南京航空航天大学信息与计算科学专业编写的.本程序利用遗传算法来求解背包问题.采用二进制字符串编码,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.

模拟退火生成树，一种比较好分类方法。程序简单，易懂。-simulated annealing Spanning Tree, a better classification. Simple and straightforward.

VC 遗传算法源码-VC genetic algorithm source code

matlab 自适应遗传算法源程序，用到了G-S正交化分解，大家可以用QR分解做一下，应该会使程序更简单一点．-Matlab adaptive genetic algorithm source code, used in the G-S orthogonal decomposition. We can do something QR decomposition, the process would be simpler 1:00.

交流 模糊控制 交流 模糊控制-Exchange of the exchange of fuzzy control fuzzy control

workbench的应用开发-application development workbench

遗传算法学习资料-GA learning materials

More AI...(GEP) Gene Expression Programming in C# and .NET 由Michael Gold用C#开发的GEP程序.-AI ... (GEP) Gene Expression Programming in C# and. By Michael Gold NET C# development of the GEP procedures.

针对现有遗传算法在多维非线性优选方面的不足，本文提出了一种基于小生境进化算法（NEA）的非线性优选模型，探讨了NEA算法的参数选择原则。通过大量仿真和比较，表明算法在复杂非线性优选中具有快速、高效、鲁棒性强的特点，并能在全局范围内有效搜索所有最优解。 -against existing genetic algorithms in three-dimensional nonlinear optimization for the shortage, the paper presents a niche evolutionary algorithm (NEA) nonlinear optimization model, the NEA on the parameters chosen algorithm principle. Through simulation and large, the algorithm shown in a complex nonlinear optimization is fast, efficient, robust features of the strong, and the global scope effective search all the optimal solution.