-
Minimum-Cost-Flow
最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下,此类问题的研究试图寻找出:流量从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.)
- 2013-08-23 23:10:20下载
- 积分:1
-
lmsxiangguan
采用lms算法实现多径信号的波束形成,并且包括输出信干燥。该代码已经完全仿真过,绝对可以用(Lms algorithm using multi-path signal beamforming, and includes output signal dry. The code has been fully simulated, can surely be)
- 2011-11-15 09:49:22下载
- 积分:1
-
mvdr
接受信号协方差矩阵估计的mvdr自适应算法。
方向图方针效果图(Receiving the signal covariance matrix estimation mvdr adaptive algorithm. Pattern renderings policy)
- 2020-12-24 16:59:05下载
- 积分:1
-
GOFBBlockCipher
implements the GOST 28147 OFB counter mode (GCTR).
- 2014-02-17 14:53:33下载
- 积分:1
-
LS_Pos
导航定位中的单点定位,采用最小二乘法计算接收机位置,进行定位。(Navigation and positioning of the single point positioning, receiver position is obtained by using the least squares method, to locate.)
- 2016-05-19 21:20:51下载
- 积分:1
-
doolittle
这个程序是将系数矩阵进行杜利特尔分解,并求解线性方程组的通用程序(This program is the coefficient matrix Doolittle decomposition and solving linear equations of the general program)
- 2010-12-29 00:14:52下载
- 积分:1
-
gm
说明: 文件为灰色建模的Matlab程序,供大家参考学习,希望互相交流,共同进步。(documents gray Matlab modeling procedures for reference learning, hope mutual exchanges and common progress.)
- 2006-10-27 09:40:51下载
- 积分:1
-
soumekh
一套完整的雷达仿真程序,雷达的各个部分的完整仿真,(A complete set of radar simulation program, the radar part of the integrity of the various simulations,)
- 2009-05-18 10:44:23下载
- 积分:1
-
JavaCard
一个出售卡片信息的源码
是我的一个作业,和大家分析一下(a sale card information source was one of my operations, and we analyze)
- 2006-12-13 23:26:26下载
- 积分:1
-
Digital-image-processing_advanced-course
This is a pdf which tells about digital image processing
- 2014-02-25 13:44:38下载
- 积分:1