搜索资源列表
邮局选址问题
- 这个是大家非常熟悉的一个非常常用的算法,邮局选择问题,相信大家一定可以学到很多东西的-This is all very familiar with a very commonly used algorithm, the post office matter of choice, I am sure that you can learn a lot of things
EMfor_neural_networks
- In this demo, I use the EM algorithm with a Rauch-Tung-Striebel smoother and an M step, which I ve recently derived, to train a two-layer perceptron, so as to classify medical data (kindly provided by Steve Roberts and Will Penny from EE, Imperial Co
Fast-K-means-clustering
- Fast mex K-means clustering algorithm with possibility of K-mean++ initialization (mex-interface modified from the original yael package https://gforge.inria.fr/projects/yael) - Accept single/double precision input - Support of BLAS/OpenMP
To24
- 算24的C代码，用BC3.1调试的，算法土了一点，很多年前刚学C语言时写的，现在再写肯定换个算法-Count 24 C code, using BC3.1 debugging, algorithm soil a bit, many years ago, just learning C language to write, but now sure to write another algorithm
G_P
- 此程序是用G-P算法计算关联维数Dc。 注意：一定要下载混沌工具箱后使用。-This procedure GP algorithm is the correlation dimension Dc. Note: Be sure to use the chaos toolbox download。
ksvdbox12
- 采用KSVD算法通过训练的方法来构造稀疏过完备字典，在使用时一定要确保已装有ompbox9。可用于语音，图像信号处理等的稀疏字典构造-KSVD algorithm using the method of training to construct the sparse over-complete dictionary, in use, make sure have been installed ompbox9. Can be used for the sparse dictionary cons
heap_sort
- heap sort is the other (and by far the most popular) in-place non-recursive sorting algorithm used in this test. Heap sort is not the fastest possible in all (nor in most) cases, but it s the de-facto sorting algorithm when one wants to make sure tha
insertion
- is the other (and by far the most popular) in-place non-recursive sorting algorithm used in this test. Heap sort is not the fastest possible in all (nor in most) cases, but it s the de-facto sorting algorithm when one wants to make sure that the sort
tuoyuannihe
- 椭圆拟合的最小二乘算法和原理。对于初学的人肯定有帮助。我也是转载的，希望对你们有帮助。-Ellipse fitting algorithm and the principle of least squares. For the beginner who is sure to help. I am also reproduced, hope you have help.
JH-algorithm
- 本文首先详细的描述了JH算法的原理，然后对JH实现软件的目标、运行环境和功能做一个整体的规划。接下来介绍软件各功能模块的具体设计步骤。最后测试软件是否能正常运行，确保软件能完成相关的功能，并不断的对软件进行完善。-This paper describes in detail the principles JH algorithm, then the goal of JH for software, operating environment and function to do a whole
main
- This file is the main file of RPN algorithm (reverse polish notation). I am pretty sure it is 100 bug less. File was checked on Wroclaw Univerity of Technology servers.-This file is the main file of RPN algorithm (reverse polish notation). I am prett
parking
- 学数据结构时最简单的两个应用的实现。一个是停车场，含有工程文件在内的所有文件。一个是通讯录，只有cpp文件。请在vc下运行，其他环境可能需要其他头文件。-Two simple applications using the knowaledge of <data structure and algorithm>. One is a parking app, with all files included. Another is a phone book . Both run wi
Matlab_zuixiaoerchengfa
- 最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法 基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 确定,如此多次迭代,最终得到最小费用最大流.- Minimum cost
Matlab_zuixiaofeiyong
- 最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法 基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 确定,如此多次迭代,最终得到最小费用最大流.-Minimum cost maximum fl
EMdemo
- EM算法在神经网络中的应用，可以用来进行视频数据分类。-In this demo, I use the EM algorithm with a Rauch-Tung-Striebel smoother and an M step, which I ve recently derived, to train a two-layer perceptron, so as to classify medical data (kindly provided by Steve Roberts and Wil
1
- 设有n件工作分配给n个人，将工作i分配给第j个人所需要的费用为Ci。试 设计一个算法，为每一个人都分配1件不同的工作，并使总费用达到最小。-suppose n pieces of work are arranged to n persons, it costs Ci to arrange work i to people j. design a algorithm to make it cost least and to make sure that everyone get one diffe
ISOMAP.MATLAB
- ISOMAP算法的matlab源程序，可直接运行，对于matlab的初学者有很好的借鉴意义，强烈推荐-It is a process written for ISOMAP algorithm.I am sure you will enjoy it
good-fpgrowth
- 本人已经调通的FP-TREE算法，VS2010下C++程序。该算法结构输出置信度和支持度，给出的源程序种包含测试数据fpdata.dat。调试了好久才调通。一定要注意：数据集里每一行数据，不能有重读出现的数字。这也是FP-TREE数据挖掘算法的的基本要求。数据集默认是.dat文件，也可以是txt-FP-TREE algorithm I has been transferred, VS2010 under C++ program. The output of the algorithm struc
tunning-PID-by-PSO
- 用PSO算法调PID参数，保证可以运行。需要MATLAB2014a及更高版本。-PID control based on the PID algorithm. Make sure your matlabe version is 2014a or higher.
GSO_IWO_IGS
- IGS算法，即GSO加入了IWO算法。可以运行，MATLAB版本在2014a以上。-IGS algorithm, that is, the GSO algorithm conbined with the IWO algorithm. make sure your matlab version is 2014a or higher.