Framework for Genetic Algorithm

基于熵函数的语音端点检测方法.rar格式为ｖｉｐ-voice endpoint detection methods. Rar format vip

遗传算法优化程序-genetic algorithm optimization procedures

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

cost存放了一个强连通图的边权矩阵，作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.

Vc++下如何利用Matlab工具箱进行数字信号处理-Vc++ How to use Matlab toolbox for digital signal processing

Joone神经网络开源－－框架完全手册，但是，是英文的。不过很值得一看，-Joone neural network revenue- the framework of full manual, however, is English. But it is worth a visit,

The code on this diskette has been organized by chapter. Each subdirectory containing listing has a readme.txt describing program usage and any relevent file formats. The readme will also describe how to compile the target programs under IBM OS/2 (TM) using the using C Set++ compiler (TM). All programs on this diskette have been compiled and tested in this environment. The majority of programs on this diskette should port to other environments with only minor adjustments. The exception to this are those programs which utilize presentation manager for graphical display of program data. In particular, the grid1 programs in chapt4ackprop and chapt3 fall into this latter category.

k-means(欧氏距离)聚类算法是最基本的聚类算法，是理解和应用聚类算法的基础，通过k-means(欧氏距离)聚类算法我们才可以初步了解数据挖掘的原理。-k-means (Euclidean distance) clustering algorithm is the most basic clustering algorithm, is understanding and the basis for the application of clustering algorithm, through the k-means (Euclidean distance) clustering algorithm we are able to a preliminary understanding of the principles of data mining .

运用BP网络实现三个二进制位的异或运算,带有样本库可编译运行-The use of BP networks realize the three-bit binary XOR operation with a sample library can be compiled to run

bayes network classifier toolbox 贝叶斯网络分类工具箱-bayes network toolbox Bayesian classifier network classifier Toolbox