-
Leach
现成的——leach协议剩余节点和时间关系的awk脚本(Ready-made- leach agreement between the remaining nodes and the time awk script)
- 2010-12-03 15:36:00下载
- 积分：1
-
Wang
MATLAB利用线性矩阵不等式解决控制系统的观测器设计问题并求解出了正定矩阵
(MATLAB linear matrix inequality solve observer design the control system and solved a positive definite matrix)
- 2015-05-27 15:10:38下载
- 积分：1
-
791793258ssc_battery_management
文件类型为mdl，为蓄电池能量管理matlab的simulink仿真模型。(Matlab simulation of battery energy management)
- 2020-09-07 16:28:03下载
- 积分：1
-
system_identification
有关系统辨识的课件以及相关辨识方法的matlab程序，很实用的。(The system identification of courseware and related identification methods matlab program, very useful.)
- 2010-07-06 21:06:45下载
- 积分：1
-
OFDM
OFDM基本原理仿真程序，本程序是基于IFFTFFT实现的OFDM系统仿真(The basic principles of OFDM simulation program, this program is implemented based on the OFDM system simulation IFFTFFT)
- 2009-10-23 10:37:43下载
- 积分：1
-
w3_generalization
machine learning 方面有关于Generalization and Bayesian Introduction的资料，语言是python(machine learning aspects of information concerning Generalization and Bayesian Introduction, language is python)
- 2013-12-07 23:11:31下载
- 积分：1
-
wimax_ofdm
基于第三代通讯wimax核心编码ofdm编码的matlab性能仿真(based on the third generation telecommunications wimax core coding ofdm coding Matlab Performance Simulation)
- 2007-05-02 16:08:44下载
- 积分：1
-
emd
matlab上的EMD源程序，无需任何调试，可以直接运行，方便好用！(EMD on matlab source, without any debugging, you can run directly, easy to use!)
- 2015-04-15 16:59:12下载
- 积分：1
-
1
说明： matlab图像处理小程序,包括，图形显示、滤波，除噪、变换等。适用于一些新手。(MATLAB image processing procedures, including graphics display, filtering, denoising and transform. Apply to beginners.)
- 2015-04-19 22:01:17下载
- 积分：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
