基于熵函数的语音端点检测方法.rar格式为ｖｉｐ

遗传算法基本原理PPT下载，适合初学者学习，一共有四部分。-The basic principles of genetic algorithms PPT download, suitable for beginners to learn, a total of four parts.

粒子群优化算法(PSO)是一种进化计算技术(evolutionary computation).源于对鸟群捕食的行为研究 PSO同遗传算法类似，是一种基于叠代的优化工具。系统初始化为一组随机解，通过叠代搜寻最优值。但是并没有遗传算法用的交叉(crossover)以及变异(mutation)。而是粒子在解空间追随最优的粒子进行搜索。详细的步骤以后的章节介绍 同遗传算法比较，PSO的优势在于简单容易实现并且没有许多参数需要调整。目前已广泛应用于函数优化，神经网络训练，模糊系统控制以及其他遗传算法的应用领域-Particle Swarm Optimization (PSO) is an evolutionary technology (evolutionary computation). Predatory birds originated from the research PSO with similar genetic algorithm is based on iterative optimization tools. Initialize the system for a group of random solutions, through iterative search for the optimal values. However, there is no genetic algorithm with the cross- (crossover) and the variation (mutation). But particles in the solution space following the optimal particle search. The steps detailed chapter on the future of genetic algorithm, the advantages of PSO is simple and easy to achieve without many parameters need to be adjusted. Now it has been widely used function optimization, neural networks, fuzzy systems control and ot

关于细胞自动机的例子，希望有志于这领域的同仁研究-on Cellular Automata example, are interested in this area of research colleagues! !

数据挖掘中很不错的源码,一个chc算法的java源程序,有极好的可读性-data mining is a good source, a chc algorithm java source files, has an excellent readability

人脸定位实例是模式识别中一个比较复杂的技术 希望能帮到大家-Human Face Localization example is a more complicated pattern recognition technology hope to help everyone

日本V01机器人运动学算法，包括正反运动学源程序及头文件的定义-Japan V01 robot kinematics algorithm, including the pros and kinematic source and header files to the definition

用遗传算法进行排序-genetic sequencing algorithms

一个简单灵活的数据挖掘实验平台，算法基本为空，但提供读数据，基本数据预处理功能，欢迎大家使用，共同提高。-a simple and flexible experimental data mining platform, the basic algorithm for air, but for reading data, the basic data preprocessing functions Everyone is welcome to use together.

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

人脸检测源代码,是人工智能检索方面比较常用的,大家下班啊-Face Detection source code, artificial intelligence search area is relatively common, we work ah