关于cmac神经网络的很多重要文献,从各种收费网站下载到的

一个机器人信息显示系统，代码比较全，你会喜欢的-Information display system of a robot, code-wide comparison, you would like

多段图的分析算法,找到最优路径,用VC编的-more of the map analysis algorithms to find the optimal path, the series with VC

遗传算法的人工生命模拟源程序-Genetic algorithm source artificial life simulation

BP批处理源代码，可自由选择三层或多次网络，和神经元数目-BP batch source code, the freedom to choose three or more networks and the number of neurons

行人模拟，开源的程序，对行人模拟的可以联系我，mjliao@163.com-pedestrian simulation, revenue procedures, simulated pedestrians can contact me, mjliao@163.com

C++实现神经网路的bp算法，初学者可以参考下 BP algorithm of neural network s achievement based on c++, maybe it is useful to a new learner-C++ Realization of bp neural network algorithm, beginners can refer to under the BP algorithm of neural network s achievement based on c++, Maybe it is useful to a new learner

在vc上运行的回答集求解器源代码，能够供在人工智能上学习的学习者使用-Running in vc answer set solver source code, for use in artificial intelligence to learn the use of the learners

这是一个HOPFIELD神经网络程序，里面有MAKEFILE，方便读者运行-HOPFILED This is a neural network program, which has MAKEFILE easy operation

matlab中遗传算法的例子，希望对大家有用呀-Matlab genetic algorithm example, we hope to useful! !

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