-
finally
Matlab的排队问题仿真Matlab的排队问题仿真Matlab的排队问题仿真(Matlab的排队问题仿真)
- 2009-09-12 23:59:31下载
- 积分:1
-
particle-filtering-tracking-
粒子滤波方法用于跟踪,很易看懂的程序,建议初学者下载学习(Particle filter for tracking, it is easy to understand the procedures recommended for beginners to learn to download)
- 2013-11-28 16:34:11下载
- 积分:1
-
code4
普通的通信系统仿真平台的搭建,从发射端到接收端。(Ordinary communication system simulation platform structures, from the launch-ended receiver.)
- 2009-02-27 22:13:38下载
- 积分:1
-
csd
在MATLAB程序中利用FDATOOL工具得到系数,然后由此十进制系数生成CSD码(In the MATLAB program by using FDATOOL tools coefficient, then the resulting decimal CSD code coefficients generated)
- 2010-11-25 21:35:21下载
- 积分:1
-
LTR
Loop Transfer Recovery control design
- 2009-06-03 16:39:14下载
- 积分:1
-
online
这个小程序可以实现窗口的创建以及同步接收和发送消息的功能。(WHEN YOU SEND MESSAGE TO OTHERS ,THEY WILL
CAN RECEIVE IT TIGHT NOW.)
- 2014-09-17 19:43:37下载
- 积分:1
-
statepoint
利用GPS导航文件(N文件),计算实时卫星轨道位置。即利用广播星历计算卫星位置。(Using GPS navigation files (N file), to calculate real-time satellite orbital position. That position is calculated using a broadcast satellite ephemeris.)
- 2015-01-01 20:25:48下载
- 积分:1
-
EulerFHN1
自适应控制的方法估计动力系统参数,把待估参数作为一个状态变量来处理(parameter estimator adaptive control)
- 2010-10-31 14:45:34下载
- 积分:1
-
Artificial-Bee--Colony
实现了人工蜂群算法(ABC),并使用算法对几个经典的测试函数进行计算,获得了理想的结果(Artificial bee colony algorithm (ABC), and using the algorithm on several classic test function is calculated to obtain the desired results)
- 2013-04-17 08:29:13下载
- 积分:1
-
danchunxingfa
单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。
(Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination.
)
- 2011-01-17 21:01:44下载
- 积分:1