用c语言实现的bp神经网络实现异或功能，比较好用

人工智能学习指导-artificial intelligence guiding

利用hopfield神经网络解决TSP(旅行商)问题-use hopfield neural network to solve TSP salesman problem (TSP)

朴素贝叶斯分类器（Navie Bayesian Classifier）识别鼠标输入的字母A～J-Naive Bayesian classifier (Navie Bayesian Classifier) Identification of the mouse input letters A-J

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

首先采用某种编码方式将解空间映射到编码空间，每个编码对应问题的一个解，称为染色体或个体。一般通过随机方法确定起始的一群个体，称为种群，在种群中根据适应值或某种竞争机制选择个体，使用各种遗传操作算子产生下一代如此进化下去，直到满足期望的终止条件。-begin using some form of coding mapping to the solution space coding space, each encoding a corresponding solution to the problem, known as chromosome or individual. General randomly determined by the initial group of individuals, called stocks, the stocks based on fitness or some mechanism to choose the individual competition, the use of genetic Operator evolution of the next generation so on, until the termination meet expectations conditions.

将遗传算法与蚁群算法相相结合，产生的一种新算法-genetic algorithm and ant algorithm combination of a new algorithm

svm工具箱的使用范例,很详细的范例，希望对大家有用-recognition use vsm toolbox

专家系统课程设计,用计算机解决SP先生谜题,有详细代码-curriculum design expert system, computer SP Mr. Mystery solved a detailed code

遗传算法的实现（转载）-genetic algorithm to achieve (reproduced)

神经网络BP算法-neural network algorithm