-
annexamples
《面向MATLAB工具箱的神经网络理论与应用》一书中实例的所有源代码，及详细说明(ANN，matlab,hop,bp,ART)
- 2009-04-23 21:28:30下载
- 积分：1
-
RLSS
说明： 一个有用的自适应算法，递推最小二乘算法。(a useful adaptive algorithm,RLS.)
- 2009-07-24 10:27:28下载
- 积分：1
-
Automatic-Coin-Counter-Matlab-Code
Automatic Coin Counter Matlab Code
- 2011-06-18 10:16:16下载
- 积分：1
-
vs2008-matlab
matlab7与c++的混合编程：将m函数编译成dll给C++调用，从而加快开发的进度。(Matlab7 and c++ programming with mixed: make m function compiled into the DLL to c++ calls, thus speeding up the progress of the development.
)
- 2012-01-16 13:48:33下载
- 积分：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
-
bemd
Description: The function is called upon as follows:
a = bemd(im1)
im1 -> Image
a(:,:,1) => IMF 1
a(:,:,2) => IMF 2
a(:,:,3) => IMF 3
a(:,:,4) => Residu
- 2013-10-02 22:23:45下载
- 积分：1
-
Beyond_STL_cn
c++boost库的中文说明手册，说明比较详细，可以做初始学都的参考资料(the description of the boost lib ,suit for the people who)
- 2014-12-29 14:45:21下载
- 积分：1
-
bpsk
说明： 层空时码有三种普遍的检测算法：最大似然（Maximum Likelihood ,ML）检测算法、迫零（zero forcing ,ZF）检测算法、最小均方误差（Minimum Mean Squared Error,MMSE）检测算法。(There are three layers in general space-time code detection algorithms: maximum likelihood (Maximum Likelihood, ML) detection algorithm, forcing zero (zero forcing, ZF) detection algorithm, minimum mean square error (Minimum Mean Squared Error, MMSE) detection algorithm.)
- 2011-03-05 22:31:00下载
- 积分：1
-
genetic-algorithm
tutorial, matlab, genetic algorithm
- 2011-01-19 21:32:54下载
- 积分：1
-
apf_p_q_3p_3l
基于pq谐波电流检测的三相三线制有源滤波器模型。(Pq harmonic current detection based on three-phase three-wire active filter model.)
- 2011-10-02 18:04:01下载
- 积分：1
