VC++ Genetic Algorithm

一个用Java编写的分形程序。分形(Fractal)理论是Mandelbrot于20世纪70年代提出的一门非线性学科，用于描述自然界中的非平衡非线性复杂系统的有序状态。利用分形算法可以画出千奇百怪的图象。Mandelbrot集和Julia集是分形集合中最基本的两个集合-Using Java to prepare a fractal process. Fractal (Fractal) theory is the Mandelbrot in the 20th century, 70s raised a non-linear science, used to describe the nature of the non-equilibrium nonlinear complex systems in an orderly state. Using fractal algorithm can draw strange image. Mandelbrot set and Julia fractal sets is the most basic collection of two collections

该文档是清华大学的模式识别教程，该版本是网页版本，浏览非常方便，内容也非常详细，非常适合初学者，个人举得特别是支持向量机那一章描述很棒！-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.

clementine8.1中文手册经典的数据挖掘软件说明-clementine8.1 Chinese classic manual data mining software Note

对股票走势的仿真，基于agent的设计思路-The trend of the stock simulation, agent-based design ideas

禁忌搜索法对初始解、邻域个数及禁忌列表的大小等参数有比较严格的要求, 这些参数直接影响着算法的优化能力。文章提出了一种改进的禁忌搜索法, 它用有效空间来压缩搜索范围, 这样可以提高搜索效率和全局搜索能力。用短期和长期禁忌列表存储器来保证算法能搜索到全和分局空间的每一点, 并且不重复搜索。经过验算析, 证明它是一种较好的全局启发式搜索法.-Tabu search method, the initial solution, neighborhood and tabu list size of the number of parameters such as have more stringent requirements, these parameters directly affect the ability to optimize the algorithm. This paper presents an improved tabu search method, it is used effectively to compress the search space, so that can improve search efficiency and global search capabilities. Short-term and long-term memory tabu list to ensure the algorithm can search the whole and the sub-space, each point, and do not repeat the search. After checking analysis to prove that it is a good global heuristic search method.

兔子狐狸生态平衡模拟器，可以模拟兔子狐狸相互依存的状况。-The zoology balance simulator of rabbit and fox ,which can simulate the status of rabbit and fox depended on each other.

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

TSP问题是组合优化中的经典问题。其解决方法有局部优化方法和一些启发式算法,局部搜索方法充分考虑问题 的邻域结构,遗传算法有很好的全局搜索能力,memetic算法把遗传算法和局部优化算法相结合,试验结果证明,能很好地解 决TSP问题。-TSP problem is a classic combinatorial optimization problem. Its solution has a number of local optimization methods and heuristic algorithms, local search methods take full account of the issue of neighborhood structure, genetic algorithm has good ability of global search, memetic algorithm for the genetic algorithm and local optimization algorithm combining test results proved that well positioned to solve the TSP problem.

基本蚁群算法的源代码 经过一些改正 改正了原来的一些错误 可以运行 -The basic ant colony algorithm source code through a number of corrections to correct the original error can run some

A SVM classifier, with detail documents.