堆排序适合于待排序文件中记录较多的情况，因为其主要的时间开销在于建堆和调整堆...

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

是国外相关研究人员提供的发现频繁模式（包括频繁集、频繁子图等）的最新版本算法。-Foreign researchers with the relevant frequent pattern discovery (including frequent itemsets, frequent subgraph, etc.) the latest version of algorithm.

一个简单的遗传算法C++类-a simple genetic algorithm C

神经网络的源程序，一个比较新的算法，分类效果较好！-neural network source, a relatively new algorithm, better classification results!

连轧过程控制仿真程序，其中包括用自适应遗传算法进行优化的代码-rolling process control simulation programs, including adaptive genetic algorithm optimized code

实现增量SVM算法，通过对因子的选择增量式的来训练SVM，大大加快了SVM算法的训练速度-To achieve incremental SVM algorithm, through the choice of factors Incremental to train SVM, greatly accelerated the speed of SVM training algorithm. .

利用遗传算法自动进行排课-Using the genetic algorithm automatically Timetable

java编写的贝叶斯网络分类器（貌似没有模型构建和参数学习过程）-java prepared by the Bayesian network classifier (seemingly no model of the learning process and parameters)

包分类算法Hypercuts算法，包分类算法Hypercuts算法-Hypercuts

模式识别k_means聚类算法。-kmeans clutering algorithm for Pattern Recognition