登录
首页 » matlab » An-example-of-programming-interface

An-example-of-programming-interface

于 2013-08-23 发布 文件大小:708KB
0 179
下载积分: 1 下载次数: 2

代码说明:

  一个实例搞定MATLAB界面编程一个实例搞定MATLAB界面编程(An example to get MATLAB programming interface)

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

发表评论

0 个回复

  • fisherplot
    introduction of fisher
    2007-11-24 21:19:13下载
    积分:1
  • stud
    this is pdf it is very useful for study the matlab and functions
    2010-12-24 17:52:37下载
    积分:1
  • p10_10__1
    带电粒子在非匀强磁场中运动时,画出其轨迹图形(Charged particle moving in an inhomogeneous magnetic field when the draw its trajectory graphics)
    2012-07-20 10:28:07下载
    积分:1
  • codes
    Folder contains codes for nonlinear controls and documents on formation scheduling
    2013-10-11 20:11:11下载
    积分:1
  • 10.1.1.134.4053-(2)
    MATLAB CODE FOR NEURAL NETWORKS
    2013-05-08 13:20:59下载
    积分:1
  • NCS_Models_and_M-files
    m files for SIAM book, Numerical Computing with MATLAB
    2009-04-08 22:24:52下载
    积分:1
  • 分离两路语音信号 NMF bss
    说明:  nmf盲源分离,使用欠定的方法,可以用来分离两路语音信号,人声与其他音的分离(nmf_bss.The underdetermined method can be used to separate two voice signals, human voice and other voices.)
    2021-04-19 01:18:51下载
    积分: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
  • bpANDgenetic
    使用遗传算法对BP网络权值阈值进行优化,再用BP算法训练网络的代码,文本格式的(bp propoganda and genetic algorithm)
    2009-02-12 09:42:31下载
    积分:1
  • Matlab__carlight
    说明:  属于图像处理的基本,用MATLAB实现了Carlight算法。(Contains more than 100 kinds of basic image processing to achieve)
    2009-08-10 12:48:16下载
    积分:1
  • 696518资源总数
  • 106245会员总数
  • 18今日下载