-
MIP
运用分枝定界法求解混合整数规划的matlab程序( Use the branch and bound method for solving mixed integer programming procedures meaning of the of the input parameters: min f* x A* x < = b Aeq* x = beq iter_num_max: maximum number of iterations lb : each variable lower limit UB: upper limit of the each variable X0: Initial ID: 0,1 variable, ID (k) = 1 indicates the variable k is an integer variable, ID (k) = 0, represents the k variable non-integer variable ftemp_up: initial upper bound, unable to find the upper bound of the initial default is infinite IP: initial feasible solution, the initial feasible solution can not be found, the default is the empty output parameters meaning: x: y: optimal solution of the objective function value corresponding to the optimal solution time-consuming iter_num: the number of iterations of the entire branch and bound process Time: Run this program)
- 2020-11-08 10:49:47下载
- 积分：1
-
TDOAlocation
TDOA定位以及改进方法,有基础的算法，以及一些改进后的方法(TDOA location)
- 2020-06-28 21:20:01下载
- 积分：1
-
Radar-Deception-Jamming-
Radar Deception Jamming
- 2014-02-20 08:12:12下载
- 积分：1
-
featureextraction
feature etraxction in fingerprint recogintion project it is matlab code
- 2009-06-19 02:16:26下载
- 积分：1
-
atmel
for embedded programming on atmel controllers
- 2011-01-22 17:43:39下载
- 积分：1
-
CH4MATLAB
MATLAB经典示例
以示参考
十分有用(MATLAB classic example to show reference useful)
- 2013-02-25 09:14:45下载
- 积分：1
-
MIT-MRAC-normalization
MIT归一化算法，基于MIT自适应律的模型参考自适应模型，对自适应律进行了归一化处理，消除输入对系统稳定性的影响(MIT normalization algorithm, MIT adaptive law based model reference adaptive model of adaptive law were normalized to eliminate the influence of input on system stability)
- 2020-09-29 12:07:45下载
- 积分：1
-
ACDC_matlab
逆变器电路的Matlab仿真源程序，初学者可以看看(Inverter circuit and Matlab simulation source, beginners can look)
- 2013-11-09 14:38:18下载
- 积分：1
-
DOA_Matrix
DOA矩阵法二维DOA估计，基于金梁, 殷勤业. 时空DOA矩阵方法[J]. 电子学报, 2000, 28(6):8-12.(Two-dimensional DOA estimation with DOA matrix method.)
- 2017-12-01 10:20:17下载
- 积分：1
-
Matlab_zuixiaoerchengfa
最小费用最大流算法通用Matlab函数
基于Floyd最短路算法的Ford和Fulkerson迭加算法 基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
- 2012-07-27 14:54:17下载
- 积分：1
