maximum function for the genetic algorithm source code Matlab

用BP网络实现对图像的边缘进行提取，本程序为演示程序，可以看到BP在应用中的效果-BP network of image edges extraction, the procedure for the demonstration program, we can see BP in the application of the results

TSP算法，应用局部搜索法得到最优路径，已经经过优化。没有密码，可以使用，vc环境下使用。-TSP algorithm, using local search to be optimal path has been optimized. No password can be used, vc environments.

多层神经网络范例 http://www.codeproject.com/cpp/MLP.asp?df=100&forumid=148477&exp=0&select=1141594#xx1141594-multilayer neural network model http :// www.codeproject.com/cpp/MLP.asp df = 1

基本遗传学习分类系统算法，算法结构非常严谨，是不可多得的遗传算法！-basic genetic classification system algorithm, the algorithm as well as highly structured, is a rare genetic algorithm!

实现了一个简单的花朵进化的模拟过程。 花朵的种群数量是10，共进化了50代。 -The realization of a simple simulation of the evolution of flowers. Flower populations is 10, a total of 50 on behalf of evolution.

微分进化算法DE（Differential Evolution）由Storn和Price等学者于1995年首先提出。它是一种基于种群优化的新智能优化方法，它已被证明在求解过程中具有高效性、收敛性、鲁棒性等优点-Differential evolution algorithm DE (Differential Evolution) by Storn and Price and other scholars in 1995, the first place. It is a species based on the optimization of the new intelligent optimization method, which has been proved in the solving process with high efficiency, convergence, robustness, etc.

workbench的应用开发-application development workbench

java版的PrefixSpan算法实现，文件里包含了详细的文档说明，还有示例。-PrefixSpan algorithm. The document containing a detailed description and an example.

GA example in Visual Basic 6.5.

本程序利用蚂蚁算法解决TSP（旅行商问题）问题-This procedure using ant algorithm to solve TSP (Traveling Salesman Problem) problem