基本遗传学习分类系统算法，算法结构非常严谨，是不可多得的遗传算法！...

模式识别中c―均值算法，调试已通过，开发工具用的是VC＋＋6.0-Pattern Recognition in the c-means algorithm, debugging has passed, development tools using a VC 6.0

对支持向量机进行训练的一种改进的遗传算法。-On support vector machine for training an improved genetic algorithm.

数据挖掘中k-means聚类算法的实现源代码-clustering algorithm source code in data mining

一个支撑矢量机模型库，详细内容参看压缩包内的FAQ-A library for support vector machine. More detail refers to the FAQ in the package.

关联规则中的频繁项集生成算法genmax，可在linux和windows下编译运行，可能不太容易看懂。-association rules of frequent item sets genmax generation algorithm, and the Linux compiler running under windows, it may not be easy to understand.

吉林大学《计算智能》课程的课件-Jilin University, "Computational Intelligence" Curriculum courseware

petri网络的演示程序，本程序是计算机网络课程中涉及到的petri网络的演示，输入预先的转换规则，搜索可以击发的状态，设定次数进行状态转换-Petri Network Demonstration Program, the process is computer network courses related to the petri network demonstration, the importation of pre-conversion rules can search the state while working on the creation of a state for the number change

基于bp人工智能的图像识别的技术，配套源代码-bp artificial intelligence-based image recognition technology and supporting source code

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

遗传算法GA的源代码及例子-genetic algorithm source code and examples