-
patchantenna
patchantenna matlab code
- 2009-05-21 13:54:00下载
- 积分：1
-
guide
葛哲学编著《小波分析理论与MATLABR2007实现》的所有源代码·包含大量的实例和典型应用(some refer for lisp)
- 2009-07-17 20:49:38下载
- 积分：1
-
fenleiPGG
基于灰度梯度最大熵的分割方法，先通过聚类进行改进做初分割然后再进行细分割。(Segmentation of gray gradient based on maximum entropy, first through the clustering is improved. At first, then the fine segmentation segmentation.)
- 2013-12-14 14:37:42下载
- 积分：1
-
testfunctionscodess
matlab codes for global optimizers
- 2010-12-25 17:26:40下载
- 积分：1
-
MPTK-Source-0.7.0
matching pursuit code for signal processing like eeg ecg and voice.,etc.,
- 2013-09-17 18:15:42下载
- 积分：1
-
project
Audio processing using matlab
- 2009-12-18 04:11:15下载
- 积分：1
-
Single_Carrier_FDMA_MATLAB_Simulation
Single Carrier FDMA的matlab仿真程序。程序清晰明了，解释详尽。(Single Carrier FDMA the matlab simulation program. Procedures clear, detailed explanation.)
- 2009-07-10 21:12:59下载
- 积分：1
-
MSM
说明： 最短路径的通用程序，matlab，在网上整理的，有些问题，需要进一步调整。(The shortest path of the general program, matlab, online finishing, some issues require further adjustment.)
- 2008-11-16 22:59:36下载
- 积分：1
-
paper5
The Feasibility of Interference Alignment over Measured MIMO-OFDM Channels
- 2015-02-25 16:29:57下载
- 积分：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
