basic genetic algorithm program package

基于EKF的机器人SLAM演示程序, 对于搞机器人定位及地图构建的朋友会有一定帮助, 这个版本用的人比较多-EKF-based SLAM demo of the robot, the robot carry out positioning and mapping will have a certain friend to help, this version used by many people

国内的一个A*算法演示，可以自己画地图，演示效果非常好-domestic A* algorithm for a demonstration, can you paint maps, the effect was very good demonstration

数据挖掘k-measextions 算算法，改进了其中部分结构。-Data Mining k-measextions counting algorithm, to improve some part of the structure.

该文档是清华大学的模式识别教程，该版本是网页版本，浏览非常方便，内容也非常详细，非常适合初学者，个人举得特别是支持向量机那一章描述很棒！-this document is from Tsinghua University,this is the html version,it is convenient to read, it is very suitable for the elementary readers,in my own opinion,the charter of svm is very detail and easily understandable.

用遗传算法实现任务分配优化的源程序。-genetic algorithm optimization task allocation of the source.

本人编写的QR分解的神经网络算法，该算法用QR分解神经网络的隐含层矩阵，可以作为学术上的比较和分析。适合各种benchmark问题，本人还加了自动产生分类向量和自动适应各种函数的例子-I prepared the QR decomposition of neural network algorithm using QR decomposition neural network hidden layer matrix, can be used as an academic comparison and analysis. Suitable for a variety of benchmark problems, I also added automatically generated classification and automatic vector function to adapt to a variety of examples

基本蚁群算法的源代码 经过一些改正 改正了原来的一些错误 可以运行 -The basic ant colony algorithm source code through a number of corrections to correct the original error can run some

用于三分类的BP算法程序,matlab源码-three classifications for the BP algorithm procedures, Matlab FOSS

炉温模糊控制的一般性程序，可以修改各参数从而更改模糊控制表-Temperature control of the general procedures can be amended so as to change the parameters of fuzzy control Table

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