-
xiaibo1
这组程序是基于小波变换的语音去噪的例程,每个程序的具体功能见程序源码。
(This set of procedures is based on Wavelet Transform voice denoising routines, the specific function of each program, see the procedure source.)
- 2020-10-08 16:07:36下载
- 积分:1
-
ANN-and-Matlab
Matlab ebooks for basic and advances learning
Neural Networks and information security book
- 2014-12-02 12:12:00下载
- 积分:1
-
fenglifadian
风力发电控制器matlab仿真代码,大家一起参考学习。(Wind power controller matlab simulation code, with everyone learning.)
- 2013-11-29 22:16:19下载
- 积分:1
-
wheel-rail-contact-creep-force
用于轨道车辆系统动力学中轮轨接触蠕滑力的计算。(For rail vehicle system dynamics in the wheel-rail contact creep force calculations.)
- 2021-02-17 12:09:46下载
- 积分:1
-
CAcode
C/A码发生器Matlab程序,测试通过(C/A code generator Matlab procedures)
- 2009-02-18 14:12:06下载
- 积分:1
-
fisherFaceRecognitionSystem_v2
fisher face recognition and the program is very nice for the face classification.(err)
- 2007-12-28 18:37:15下载
- 积分:1
-
stiffODE
stiff ODE solver for set of equations
- 2011-08-31 08:49:30下载
- 积分:1
-
SVM
支持向量机用matlab来实现,能够实现简单的图像功能,还能让人深刻理解向量机思想(Support vector machine matlab to achieve, to achieve simple image function, but also a deep understanding of people thinking vector machine)
- 2013-10-16 22:46:03下载
- 积分: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
-
ss
说明: 输电网9节点区间潮流计算程序,修改数据可用(IEEE 9 interval power flow)
- 2015-05-09 16:35:24下载
- 积分:1