模式识别HK分类算法 vc下dos程序

基于SVM，分本分类，，是关于两类分类的比较好的工具，国外网站提供，效果很好的-based SVM, the sub-classification is on the classification of the two types of relatively good tool, overseas sites provide good results, the

这是一个笔者撰写改进了别人的隐马尔可夫模型算法的程序。-This is a writer writing improvement of the people"s hidden Markov model algorithm procedures.

这个是关于遗传算法的比较完整的C语言程序，个人觉得还是比较有参考价值。-on the genetic algorithm is relatively complete C language program, individuals think it is quite a reference value.

车辆识别-vehicle identification

遗传算法的通用程序，可以根据需要改编以适应不同的应用-Generic genetic algorithm procedure can be adapted to the needs of different applications

遗传算法演示程序-GA Demonstration Program

全面讲解了有视觉机器人的解决方案，强烈推荐-comprehensive account of a robot visual solutions and strongly recommended

用三层BP网来进行函数逼进，语言是VB6.0编写-BP network with the three-tier to function pressing language is prepared VB6.0

以上程序来自水母清华bbs,你可以到学术资源-〉signal->精华区里找， 下面是写这个程序的大虾的补充 发信人: maxxu (小小鸟), 信区: Signal 标 题: Re: 大侠们出手：高斯（白）噪声的c程序实现 发信站: BBS 水木清华站 (Fri Dec 29 16:33:07 2000)-Above procedure from the jellyfish Tsinghua bbs, you can go to academic resources-> signal-> the best area to find, the following is written this procedure to add the sender of the shrimp: maxxu (小小鸟), letter of the district: Signal heading: Re : heroes are hand: Gaussian (white) noise c program letters stand: BBS SMTH Station (Fri Dec 29 16:33:07 2000)

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