基于粒子滤波原理，选取颜色特征对目标进行描述，实现视频目标的实时跟踪，效果较好。...

模拟3G环境，测试可伸缩视频码流，适合JSVM开发者-Analog 3G environment, testing, scalable video stream, suitable for JSVM developers

调用过程 CM = Confusion_matrix(train_predicts, train_targets) [combining_predicts, errorrate] = combining_NB(DP, test_targets, CM) DP，三维数组，(i,j,k)为第k个样本的DP矩阵 targets 为 0 1 2 -process called CM = Confusion_matrix (train_predicts, train_targets) [combining_predicts, errorrate] = combining_NB (DP, test_targets, CM) DP, three-dimensional array (i, j, k) for the k samples of DP matrix targets for 0 1 2

C++,Fortran和Matlab分别实现的bp算法程序 方便初学者学习和调用-C++, Fortran and Matlab algorithm bp, respectively, procedures realize the convenience of beginners to learn and call

一个遗传算法C++类,值得收藏！-a genetic algorithm C-worthy collection!

矩形件排样优化问题是一个多目标优化问题，另一方面要考虑到生产时的下料效率-Rectangular pieces of nesting optimization problem is a multi-objective optimization problem, on the other hand, taking into account the production efficiency of the next expected

MATLAb语言的遗传算法工具箱，比较全。-MATLAb language of genetic algorithm toolbox, the entire comparison.

本人这学期写八数码作业，采用三种人工智能算法，在vc2003开发完成-I write this semester eight digital operations, in three artificial intelligence algorithm, developed in vc2003

Wavelets, Approximation and Statistical Applications-Wavelets. Approximation and Statistical Applications

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.

FP-GROWTH算法实现数据挖掘中的关联规则-FP-GROWTH data mining algorithm of association rules