登录
首页 » PDF » MATLABtoolbox

MATLABtoolbox

于 2009-06-03 发布 文件大小:443KB
0 171
下载积分: 1 下载次数: 6

代码说明:

  MATLAB工具箱详细介绍,做开发时必备的参考资料(matlab toolbox)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • times-of-cvx-function
    cvx optimation tool,times function(times function)
    2014-10-24 20:33:28下载
    积分:1
  • CDMAmATLAB
    cdma的通信matlab仿真,算法,论证,图片,结果(cdma communication matlab simulation, algorithm, demonstration, pictures, results)
    2009-10-22 16:16:13下载
    积分:1
  • speech_processing
    this program deals with simple speech processing like fft, use of hamming window, my durbin algorithm and likes. this program has gui too.
    2009-05-13 21:24:36下载
    积分:1
  • mt
    说明:  风力发电系统中基于mt坐标系的发电机模块的建模仿真(matlab/simulink)(Mt-based wind power system generator module coordinate system modeling and simulation (matlab/simulink))
    2011-05-22 14:35:02下载
    积分:1
  • 2
    说明:  ofdm_code simulator (OFDM code simulation)
    2012-05-13 16:38:59下载
    积分:1
  • ICALABIPv2_0
    独立分量分析工具,ICAlab,可以对了解独立分量分析的具体操作。(Independent component analysis tools, ICAlab, specific actions can understand the independent component analysis.)
    2013-03-20 21:04:28下载
    积分: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
  • Optimization
    Genetic algorithm Beecolony PSO
    2009-12-15 21:55:40下载
    积分:1
  • renyan_2
    基于图像4个方向通道的滤波,增强小目标与周围背景的对比度(4 direction of the channel-based image filtering, enhanced small target contrast with the surrounding background)
    2014-11-10 11:09:54下载
    积分:1
  • H6S1
    digital signal processing homwork
    2013-12-26 17:17:57下载
    积分:1
  • 696518资源总数
  • 106259会员总数
  • 28今日下载