本人编写的GramSchmidt神经网络算法，和传统的神经网络算法比较，该算法能自动产生神经元，节约时间，速度快！ 本人还加了自动产生分类的方法和适合各种函

利用SOM（Self-Organization Map）数据聚类方法，包含点数据集的坐标，并以TChart分组为例进行说明。

改进遗传算法－郭涛算法做最优化问题很管用,算法的基本思想是 先任意产生n个随机数，然后从n个数里随机选择m个数，再有这m个 数合成一个新数，将这个新数同n个数中间适应值函数值的最差的比较， 如果好的话就取代最差的那个，如果它比最好的还要好的话，则把最好的 也取代。如果比最差的坏，则重新合成一个新数。依次循环下去。 程序的奇妙之处是GA_crossover()函数，产生的新数确实比较好，看看 那位大侠能改进一下，产生比这跟好的数。-improved genetic algorithm- Guo Tao done optimization algorithm is very effective, and the algorithm is the first basic idea arbitrary n generated random number and then the number li n m randomly selected number, and this number m of a new synthesis of the new middle with n number fitness function of the worst by comparison, if a good case to replace the worst, um, if it even than the best, then ruled the best have replaced. If worse than the worst, a de novo synthesis of new. Followed by the cycle continues. The magic of procedures is GA_crossover () function, the new really good to see heroes who can be improved upon, it generated more than a few with a good.

这个是SA模拟退火求函数极值用c++编译的程序-the simulated annealing SA is seeking function using extreme procedures c compiler

混合生源 加工-Mixed biogenic processing

很好的神经网络教程，里面包含源代码，可以进行相关的修改!-Good neural network tutorial, which contains the source code, can be related to changes!

可以自动识别一个程序中调用的所有函数，并写入到 output.txt文件中。-can automatically identify a process called all functions, and write to output.txt document.

一个外国人写的字符识别训练源码，VC++源码，有源码、说明及演示可执行程序，对学习和研究模式识别很有帮助。-written by a foreigner Character Recognition training source, VC source, a source that, and the demonstration of the executable, on learning and pattern recognition research helpful.

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

基于基本遗传算法的函数最优化 ，这也是本人收集的遗传算法优化软件，望对本网站有所帮助！！ -based on the basic function of genetic algorithm optimization, which I gather the genetic algorithm optimization software, look on this site help! !

SCE算法： 简单进化算法的matlab标准实现，内含3个m文件，英文说明。-SCE algorithm: a simple evolutionary algorithm matlab standards achieved, containing 3 m documents, the English description.