遗传算法简称GA(Genetic Algorithm)，在本质上是一种不依赖具体问题的直接搜索方法。遗传算法在模式识别、神经网络、图像处理、机器学习、工业优化控...

混合生源 加工-Mixed biogenic processing

SVM分类器，由上海交通大学编写，软件使用方便、好用-SVM classifier, from the preparation of the Shanghai Jiaotong University, the software easy to use, handy

有关TSP遗传算法的的三个pdf论文。不错的参考-The TSP of the three genetic algorithms pdf papers. A good reference

带有QoS约束的组播路由问题是一个NP完全问题，遗传模拟退火算法是遗传算法和模拟退火算法的一种融合，可以为这类问题提供一个解决方案-With QoS constraint multicast routing problem is an NP-complete problem, genetic simulated annealing algorithm is a genetic algorithm and simulated annealing algorithm as a fusion, you can provide for such a solution

新手上路： 自己编写的BP神经网络程序，还不是成熟，希望能够加入社区和高手们学习学习-Getting Started: I have written procedures for the BP neural network, is not yet mature, I hope you can join the community and learning to learn

Java遗传算法库-Java genetic algorithm library

使用遗传算法求解邮递员问题，从而可以同时求得多个最优解-The use of genetic algorithm postman problem, which can be obtained at the same time more than the optimal solution

汉语分词系统，对中文语句进行识别，然后分词，是很好的自然语言理解的例子-Chinese word segmentation system, the Chinese phrase for identification, then Word, is a very good natural language understanding examples

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...

Particle Swarm Optimization (PSO) for the TSP