-
adaptive_filtering_matlab
This PDF is about adaptive filters that is with matlab and is very usefull
- 2012-07-31 03:13:18下载
- 积分：1
-
MOACO
多目标蚁群算法，蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。(MOACO，Multi-objective ant colony algorithm)
- 2015-08-15 18:43:35下载
- 积分：1
-
Rayleigh_Channe_OFDM
特别 经典 一些Rayleigh信道相关的OFDM的matlab代码(Some special classical Rayleigh channel related OFDM the matlab code. Rar)
- 2009-02-27 09:25:20下载
- 积分：1
-
baizaosheng
本程序能实现基于小波模极大值算法去除高斯白噪声。效果显著(This procedure can achieve based on wavelet modulus maxima method to remove Gaussian white noise. Remarkably)
- 2009-11-09 16:34:38下载
- 积分：1
-
chap8
《智能控制》第二版（刘金琨著）程序源码第八章(" Intelligent control" , Second Edition (Liu Jinkun a) of Chapter VIII of program source code)
- 2011-04-26 09:44:43下载
- 积分：1
-
matlabImageprocessingsourcecode
matlab 图像处理源代码，比较全，有多个matlab程序(matlab image processing source code, compare the whole, there are several matlab programs)
- 2010-07-22 15:06:59下载
- 积分：1
-
Arnoldmatlab
二值图像的arnold置乱，二值图像为方阵，作用是打乱图像的相关性(Arnold scrambling of the binary image, binary image for the square, to disrupt the image correlation)
- 2012-05-25 21:48:16下载
- 积分：1
-
huffman
生成霍夫曼编码和解码程序，本程序包含几个子程序，主程序会自动调用。(Generate Huffman coding and decoding procedures, the program contains several subroutines, the main program will automatically call.)
- 2011-07-12 16:05:19下载
- 积分：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
-
learningpid
pid control of dc motor
- 2009-03-09 12:40:22下载
- 积分：1
