-
Reed_Muller
matlab 实现 Reed Muller 编码及误码率曲线的绘制(matlab implementation Reed Muller code and BER Curve)
- 2010-05-06 16:08:41下载
- 积分：1
-
mang_v23
包含飞行器飞行中的姿态控制，如侧滑角，倾斜角，滚转角，俯仰角，可以广泛的应用于数据预测及数据分析,相参脉冲串复调制信号。( It comprises aircraft flight attitude control, such as slip angle, tilt angle, roll angle, pitch angle, Can be widely used in data analysis and forecast data, Complex modulation coherent pulse train signal.)
- 2017-03-07 16:56:08下载
- 积分：1
-
Matlab
matlab程序，里面有关于数学建模的各种程序，很实用(matlab program, there are various programs on mathematical modeling, it is practical)
- 2011-04-29 15:30:23下载
- 积分：1
-
shudianwang
这是一个典型的输电网模型，数和加在各种模型中(This is a typical power grid model, the number of processing in a variety of models)
- 2011-07-09 11:11:07下载
- 积分：1
-
pinpu
建筑风工程实测加速度的互功率谱和自功率谱的计算(Building wind engineering measured acceleration crosspower and auto-power spectrum calculation)
- 2014-12-11 19:47:54下载
- 积分：1
-
fuzzy-control-bilinear-systems
对双线性时滞系统进行T-S模糊控制，满足系能指标，鲁棒控制(Bilinear time-delay system for TS fuzzy control system able to meet the targets, robust control)
- 2014-02-16 11:06:43下载
- 积分：1
-
ECGwaveGen
ce fichier contient un code matlab pour filtrage ecg using wavelet
- 2010-10-19 20:07:42下载
- 积分：1
-
C_C
C——C方法计算，用于相空间重构分析，很好很使用的一种方法(C- C method for phase space reconstruction analysis。It is ery good and useful。)
- 2012-04-12 11:31:05下载
- 积分：1
-
PSO
粒子群优化算法（PSO）研究
粒子群优化算法（PSO）研究(PSO Particle Swarm Optimization Algorithm)
- 2009-02-28 10:20:42下载
- 积分：1
-
maxcost
“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。
(" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
- 2010-12-22 17:27:32下载
- 积分：1
|
联系客服（QQ：3324461878）
