汉字识别的一个小例子 识别率不是那么高，但还是可以借鉴的...

新手上路： 自己编写的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

遗传算法的讲义！- Heredity algorithm printed lecture!

人工智能GRAPHSEARCH算法C语言实现-GRAPHSEARCH artificial intelligence algorithm C Language

严格按照BP网络计算公式来设计的一个matlab程序,对BP网络进行了优化设计-Neural Network――BP

传统遗传算法程序。开发环境为visual C-Traditional genetic algorithm procedure. Development environment for visual C

有关RBF的参考文献，希望能够给你带来一定的帮助-RBF-related references, hoping to give you some help

Adaptive Resonance Theory (ART) Neural Network

这是一个模式识别中的parzen窗的一个简单仿真分类实例，其中female.txt和male.txt是训练样本，test.txt是测试样本，分类效果非常好，对于模式学习的初学者将会有很大帮助。-This is a pattern recognition in a simple window parzen Category simulation examples, one of female.txt and male.txt training samples, test.txt is the measurement, classification effect is very good for beginners will be learning model has very big help.

真正可以用的匈牙利算法 我校赛的时候用过 很不错 不过写的不够简洁-Really can use the Hungarian algorithm school tournament when I used is pretty good but not enough to write a concise

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