-
QPSKtiaozheiofdmfangzhen
说明： QPSK调制的ofdm仿真，采用matlab语言编写，忽略了信道估计等部分。(QPSK modulation ofdm simulation using matlab language, ignore the part of the channel estimation.)
- 2010-04-29 09:22:32下载
- 积分：1
-
Beamforming
Its MVDR beamforming technique
- 2011-05-19 15:03:57下载
- 积分：1
-
Control-of-an-Inverted-Pendulum
model of Inverted Pendulum
- 2012-09-17 02:35:32下载
- 积分：1
-
yichuansuanfa
遗传算法程序，包含变异等各个步骤，用于求一个二元函数的极值，条理清晰。(Genetic algorithm, including the various steps of the mutation, for seeking a binary function extremum clarity.)
- 2013-05-05 23:04:45下载
- 积分：1
-
Passeges
实现了电梯客流仿真，且运行结果与实际相符(realize the simulation of passengers who will take elevator. The results are the same as fact.
)
- 2012-02-26 01:20:43下载
- 积分：1
-
Skeleton
获取对象骨架的方法，不同于matlab自带的bwmorph方法，但速度较慢(Access to the object skeleton methods, different from the matlab built-in bwmorph, but slower)
- 2008-04-20 09:44:22下载
- 积分：1
-
qpskd
qpSK matlab modulation
- 2009-07-09 23:57:28下载
- 积分：1
-
ECG-detection
检测心电. 输入为ECG的时域的数字离散化序列,输出检测到的R波数量,绘制.(detection of ECG.)
- 2012-05-24 15:04:03下载
- 积分：1
-
vsPmatlab
vs2010调用matlab.m文件生成的lib,dll,h文件，并进行参数的传递(vs2010 calling matlab.m files generated lib, dll, h file and pass parameters)
- 2013-11-27 21:42:54下载
- 积分：1
-
分支定界法
说明： 分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。
对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1]
通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems.
For integer programming problems with two variables, the grid method is sometimes simpler[ 1]
Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
- 2021-04-26 12:21:14下载
- 积分：1
