tanlansuanfa

最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下，此类问题的研究试图寻找出：流量从A到B，如何选择路径、分配经过路径的流量，可以达到所用的费用最小的要求。(Minimum cost maximum flow problem is economics and management in a class of typical problems. Each path in a network has the " capacity" and " costs" two limiting conditions, such problems of trying to find out: Flow from A to B, how to choose the path, the path of the flow through the distribution can be achieved The use of the minimum cost requirements.)

说明：  matlab基于HMM的语音识别完整代码(需要修改程序里的路径以找到文件)(matlab)

鲁棒控制的matlab工具箱，编程pdf工具箱，对于学习鲁棒控制编程作用很大。(Robust control toolbox matlab, programming pdf toolbox, robust control for learning the role of great programming.)

说明：  地球绕圆心的运动，对各位应该有启发地球绕圆心的运动(The Earth' s movement around the center of a circle, there should be instructive for you)

matlab俄罗斯方块程序，，非常真实的界面，MATLAB_GUI设计多多学习(Tetris matlab procedures, very real interface, MATLAB_GUI design a lot to learn)

Algoritmo de K-Vecinos Más Cercanos

shortest distance routing algorithm

distance regularized level set evolution for edge detection

KALMAN FILTER CODE for tracking

在MIMO系统下，空时分组码在不同天线下的性能（基于接受信号合并）(STBC performance under different antenna)