登录
首页 » matlab » moesp

moesp

于 2014-10-23 发布 文件大小:2KB
0 165
下载积分: 1 下载次数: 18

代码说明:

  子空间matlab建模程序实力,是期中的MOESP方法!(Subspace matlab modeling program strength is period of MOESP way!)

文件列表:

moesp.m,4484,2010-06-25

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

发表评论

0 个回复

  • united
    小波去噪程序 缺少数据 数据都是一维的 程序比较简单 望见谅 ( a matlab denoise program )
    2010-12-30 20:20:05下载
    积分:1
  • lmscomunication
    说明:  matlab 防真自适应滤波器(部分)考虑时变代价函数 (Matlab defense really adaptive filter (part) when considering variable cost function)
    2006-03-21 15:39:59下载
    积分:1
  • sinmulating-five-Riemann-problems
    用于计算流体力学中五类黎曼间断问题数值模拟(Program Used for five kind of Riemann problem in CFD)
    2013-07-18 21:56:38下载
    积分:1
  • ICA
    Imperialist Competitive Algorithm
    2014-01-05 23:05:09下载
    积分:1
  • MATLAB-Commonly-used-functions
    常见的matlab的函数使用介绍以及常用的matlab进行数值计算的程序(Common function introduced the use of MATLAB and MATLAB for numerical calculation program)
    2015-04-09 08:13:24下载
    积分:1
  • eg22-renliangchaoxiangshibie
    《MATLAB神经网络30个案例分析》中的第22个例子,案例22 LVQ神经网络的预测——人脸朝向识别。希望对大家有一定的帮助! (The MATLAB neural network analysis of 30 cases of 22 example, 22 cases of LVQ neural network prediction, face toward the identification. Hope to have certain help to everybody!)
    2013-09-20 16:38:10下载
    积分:1
  • tracking-geta
    一篇关于数据关联性能评价的优化跟踪门算法,发表于电子学报,文章还是不错的(An article about optimized gate on multi-target tracking in the journal of electronic, very good!)
    2014-11-29 15:20:15下载
    积分:1
  • shiyan6
    matlab应用程序 可直接用 ,运用只能算法解决旅行商问题(Matlab application can be used directly, only USES the algorithm to solve traveling salesman problem )
    2015-01-09 17:40:55下载
    积分:1
  • Turbo555996
    说明:  讨论了一种用于11)一SCDMA(3GPP TDD LCR)技术的硬件Turbo解码器浮点模型, 阐述了该模型的设计、架构和优化, 指出这种浮点模型具有结构简单、计算速度快、读写存储 器效率高以及采用了Maxlog MAP算法和步进窗口iJi『练技术(SWWT)的特点。(TDSCDMA)
    2009-08-01 10:34:28下载
    积分:1
  • 0-1programming
    0-1整数规划有很广泛的应用背景,比如指派问题,背包问题等等,实际上TSP问题也是一个0-1问题,当然这些问题都是NP问题,对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的,本程序只不过是一个练习,得意之处是用递归法把所有解都排列出来。另:胡运权所著的《运筹学基础及应用(第三版)》第97页的例3,我用本程序求解得到的结果是:最优解是x*=(1,0, 0, 0, 0),最优值是f(x*)=8,但书求得最优解是x*=(1,0, 1, 0, 0),最优值是f(x*)=4,是不是书中写错了,请大家验证。以下是源程序,大家可以任意使用无版权问题,另外,如果大家有大规模的0-1规划的问题也希望提供给我,谢谢。变量个数至少是3个(0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source)
    2006-07-01 10:33:18下载
    积分:1
  • 696518资源总数
  • 105885会员总数
  • 31今日下载