登录
首页 » matlab » floc_music

floc_music

于 2010-04-06 发布 文件大小:5KB
0 178
下载积分: 1 下载次数: 1

代码说明:

说明:  本程序有传统的MUSIC算法和基于分数低阶矩的MUSIC算法 在alpha稳定分布下的性能仿真(this programme contain the performence of traditonal MUSIC algorithm and FLOC MUSIC algorithm under the alhpa steady distrubution)

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

发表评论

0 个回复

  • hfjh
    摄影测量中求的相片的6个外方位元素是所用的后方交会程序(Resection)
    2010-05-12 14:30:41下载
    积分:1
  • YIQun
    Matlab实现蚁群寻找最短路径的TSP问题,有图像描述。(Matlab to find the shortest path to achieve ant TSP problem, there is the image description.)
    2011-06-26 08:58:43下载
    积分:1
  • zycl
    最优潮流计算,matlab版,希望对电力系统仿真的同志有用!(OPF, Matlab version, and I hope to the power system simulation comrades useful!)
    2007-04-10 21:33:38下载
    积分:1
  • STFT
    matlab编程时不采用工具箱内的内部函数specgram,按照计算过程直接编写仿真程序(matlab stft)
    2011-10-27 16:12:13下载
    积分:1
  • array_lsb
    This code is the implementation of LSB technique
    2013-04-06 15:01:00下载
    积分:1
  • mempa
    说明:  matlab源码实现记忆多项式模型的功放建模(Memory polynomial model power amplifier )
    2011-04-14 20:35:39下载
    积分:1
  • Plotting_Tutorial_New1
    Plot tutorial is using to calculate in Histogram Matlab
    2013-12-08 13:27:43下载
    积分:1
  • rotation
    rotate any digital image to 3 different degrees with gui in matlab.
    2009-11-20 11:39:32下载
    积分:1
  • image-color
    matlab实现图像的颜色处理 设置 颜色变换等功能(image color setting)
    2012-04-28 18:44:07下载
    积分:1
  • tsp
    蕞优分组周游路线问题是一类物流智能调度问题,是众多的计算难度极大的组合爆炸问题之一。自从运输问题最早是由Hitchcock在1941年提出的[2][4]后,人们对这一类问题给予了极大的关注并进行了大量的研究,提出了有效解决问题的优化算法——单纯形法的变形[2]。但由于问题规模的扩大,纯数学方法在允许的时间和空间上都很难找到问题的最优解,于是人们开始转向寻找问题的近似最优解,遗传算法以其在求解最优化问题中的独特的自组织性、自适应性很快进入人们的视野。 经典的遗传算法对于求解多目标的NP完全性问题非常有效,但对于有多个限制条件的多目标最优化问题缺显得有点力不从心,很难得到稳定度较高、收敛较快的解。本文提出的双层遗传算法模型给这一类问题提供了一个很好的解决方法,虽然建模条件限制了描述的问题的通用性,有待推广,但它能有效利用问题的领域知识,提高了求解效率,保证了解的可行性和最优性,算法思想极具推广潜力,可在其它物流智能调度问题求解算法设计中借鉴。(The most optimal packet travel route problem is a kind of intelligent logistic scheduling problem is one of combinatorial calculation difficult problem many. Since the transportation problem was first proposed by Hitchcock in 1941 after the [2][4], the people of this class of problems given great attention and made a lot of research, the deformation of [2] optimization, simplex method algorithm is effective to solve the problem of. But due to the expansion of the scale of the problem, the pure mathematical methods in the allowed time and space are very difficult to find the optimal solution of the problem, so people begin to turn to the approximate optimal solution for the problem, genetic algorithm in solving optimization problems with its unique in the self-organizing, adaptive soon entered people s field of vision. Very effective classical genetic algorithm for solving multi-objective NP complete problems, but for the multi-objective optimization problem with multiple constraints. I)
    2014-08-18 10:05:55下载
    积分:1
  • 696518资源总数
  • 106148会员总数
  • 10今日下载