用于程序优化与遗传算法

机器人编程方法，主要是讲c的， 期刊论文-Robot programming method, mainly stresses c and Journal Papers

一个经典的C语言遗传算法程序包，可直接用来开发遗传算法的应用程序-a classic genetic algorithm C language package can be used directly for the development of the genetic algorithm application

在matlab6.5下实现的 -achieved in the matlab6.5

用模拟退火算法求解TSP问题-simulated annealing algorithm for TSP

LMS-Newton自适应算法源码 反正结果刻与LMS算法相比较，显示了较好的性能。-LMS-Newton adaptive algorithm source code in any case engraved with the LMS algorithm results compared, showing a better performance.

bp神经网络模拟，是根据以立体的模拟程序-bp neural network simulation, which is based on a three-dimensional simulation program

一个很好的LIBSVM的JAVA源码。对于要研究和改进SVM算法的学者。可以参考。来自数据挖掘工具YALE工具包。-a good LIBSVM JAVA source. They should study and improve SVM academics. Reference. From Data Mining Tool Kit Yale.

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为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 ...

演化计算是基于随即搜索的新算法；它的技术模型源于自然的演化。下面是一个例子，该函数是典型的多峰（震动剧烈）的函数。用的算法是郭涛算法。-evolutionary computation is based on the then new search algorithm; It stems from the technical model of the natural evolution. Below is an example of this function is a typical multi-feng (severe shock) function. The algorithm is Guo Tao algorithm.

神经网络中的tsp的模拟退火算法的matlab实现-neural network tsp of the simulated annealing algorithm to achieve the Matlab