遗传算法求解tsp文题 里面包括了执行文件

运用遗传算法对交通流进行分配-use of genetic algorithms on traffic flow distribution

遗传算法优化神经网络结构和链接权，采用浮点数编码-Genetic algorithm neural network structure and link the right to use floating-point encoding

科罗拉多大学开发的人脸识别系统,要在UNIX下运行.-developed at the University of Colorado, the face recognition system to run under UNIX.

十折交叉验证方法的matlab code 再模式识别中是一个非常重要的试验方法-a very important technique crossvalidate in pattern recognazition

The code on this diskette has been organized by chapter. Each subdirectory containing listing has a readme.txt describing program usage and any relevent file formats. The readme will also describe how to compile the target programs under IBM OS/2 (TM) using the using C Set++ compiler (TM). All programs on this diskette have been compiled and tested in this environment. The majority of programs on this diskette should port to other environments with only minor adjustments. The exception to this are those programs which utilize presentation manager for graphical display of program data. In particular, the grid1 programs in chapt4ackprop and chapt3 fall into this latter category.

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

介绍 ROBOCUP 3D SERVER的一些资料，网少比较少的，有兴趣的朋友可以研究看看。-ROBOCUP 3D SERVER introduce some of the information, the relatively small network of small, interested to see if a friend can be studied.

BP模型逼近异或问题，可观测隐层节点数及隐层数对模型的影响-BP model approximation differences or problems, the observation can be hidden nodes and hidden layers of the model

本程序实现了多城市的tsp问题（即旅行商问题）的遗传算法-the process of multi-city tsp (ie, the traveling salesman problem) Genetic Algorithm

非线性规划中求解无约束问题中的一个有效方法--模矢法(步长加速法),并用图表示出来步骤.-Nonlinear Programming Solution unconstrained problem of an effective method-- vector mode (step acceleration), and using map out steps.