-
fdtd42
FDTD CODE 3D
FOR ANTENNA
IT IS REALLY USEFULL
- 2013-07-21 23:12:42下载
- 积分：1
-
Classifier_NN_f
最近邻分类器，matlab环境下，可直接调用(Nearest neighbor classifier, matlab environment, can be called directly)
- 2010-06-28 13:43:33下载
- 积分：1
-
double_pendulum_documentation
double_pendulum_documentation paper about it
- 2014-01-25 15:47:59下载
- 积分：1
-
Convolutional-Encoder
this is a Simulation s of matlab for convolutional Encoder.
in it s result you will see plots for convolutional encoder and decoder.there is also two .jpg files that show the schematic of decoder and encoder.
- 2011-07-08 18:01:00下载
- 积分：1
-
RF
说明： 数值分析 清华大学 杨顶辉 数值实验4.1 算法设计与比较(numerical analysis)
- 2020-12-25 20:49:03下载
- 积分：1
-
ofdm2
说明： ofdm的变成实现，一本中文书上的例程，供大家参考(The realization of ofdm, a routine in a Chinese book, for your reference)
- 2019-04-02 18:18:55下载
- 积分：1
-
3
说明： Segmentation using watershed is very easily to separate the overlapping cell.
- 2011-05-03 09:48:52下载
- 积分：1
-
Perbandingan-Metode-Mean-Filtering-dan-Median-Fil
COMPARISON OF MEAN AND MEDIAN FILTER METHOD
- 2014-01-17 04:55:05下载
- 积分：1
-
ACOTSP-1.02
aco tsp algorithm to matlab
- 2012-11-18 06:29:56下载
- 积分：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
|
联系客服（QQ：3324461878）
