-
fxyj
JULIA集合的几个分形图，后附有MATLAB原程序代码。(JULIA集合的几个分形图，后附有MATLAB原程序代码)
- 2009-03-25 19:20:38下载
- 积分：1
-
tongji-m
几个用于统计方法的matlab程序，结构简单，运算快捷，节省内存(Several statistical methods for the matlab program, simple structure, computing faster, save memory)
- 2008-05-04 20:48:37下载
- 积分：1
-
econdispatchlongcode
economic dispatch using lagrange method
- 2012-05-28 13:06:18下载
- 积分：1
-
zfsb
基于matlab的字母识别，基于模板匹配，因为采用区域生长法，速度可能有些慢！(Base on matlab!)
- 2013-12-16 12:03:48下载
- 积分：1
-
dsp2
本程序利用MATLAB进行数字信号的频谱分析，适用于DSP的初学者。代码里应用了矩形窗和汉明窗两种窗函数进行对比分析。(This procedure carries on the digital signal using MATLAB the spectral analysis, is suitable in the DSP beginner. In the code has applied the rectangular window and the hamming window two kind of window box number carries on the contrastive analysis.)
- 2009-06-24 22:33:23下载
- 积分：1
-
MATLAB-7_0
matlab7.0程序设计快速入门 基础教程(matlab7.0 Programming Quick Start)
- 2011-09-19 10:35:50下载
- 积分：1
-
waveletstoolbox
基于matlab的小波变换工具包，适合学习小波变换入门(Matlab wavelet transform based toolkit for learning wavelet transform entry)
- 2010-12-01 22:47:30下载
- 积分：1
-
ro
说明： removal of 50 hz noise (power line interference) from ecg signal using adaptive filtering
- 2009-06-08 23:34:03下载
- 积分：1
-
MIMLdros
包括MATLAB的代码:MIMLSVM+和E-MIMLSVM+(MIMLdros includes the MATLAB codes of MIMLSVM+ and E-MIMLSVM+ which are MIML algorithms that have been applied to drosophila gene expression pattern annotation. The package contains a Readme file which explains how to use it.)
- 2011-05-12 16:26:52下载
- 积分：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
