登录
首页 » matlab » firefly_simple1

firefly_simple1

于 2012-05-11 发布 文件大小:1KB
0 261
下载积分: 1 下载次数: 521

代码说明:

  一个萤火虫算法,很好用的。只需要换测试函数即可。不过请注意例如萤火虫个数的等参数的更换。(A firefly algorithm, easy to use. Merely need to replace the test function can be. Oh Oh Oh Oh)

文件列表:

firefly_simple1.m,3145,2012-04-24

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

发表评论

0 个回复

  • 1
    说明:  Matlab编写BPSK信号通过AWGN信道的仿真过程(Matlab write BPSK AWGN channel signal through the simulation process)
    2010-04-28 08:40:24下载
    积分:1
  • stroboscopic-model
    采用非线性动力学分析方法来研究互联网拥塞控制系统中存在 的复杂非线性动力学现象,如分岔(bifurcation)、混沌(chaos)等,针对不同参数该组源程序仿真互联网拥塞控制系统频闪模型的非线性动力学现象。(The programs study the dynamic behavior in stroboscopic model of Internet congestion control system is studied. )
    2013-07-18 17:26:51下载
    积分:1
  • haofen
    采用的是通用的平面波展开法,基于matlab GUI界面设计,模式识别中的bayes判别分析算法。( Using common plane wave expansion method, Based on matlab GUI interface design, Pattern Recognition bayes discriminant analysis algorithm.)
    2017-01-30 12:03:56下载
    积分:1
  • ex9_4
    产生7位巴克码和线性调频的混合调制信号(7 Barker Code generated and linear FM modulated signals mixed)
    2008-05-04 14:51:04下载
    积分:1
  • 解线性方组的迭代法
    利用matlab编程实现解线性方程组的迭代法。(using Matlab programming for solving linear equations of iterative method.)
    2005-06-12 22:10:32下载
    积分:1
  • NewtonIteration
    求最小PID可达方差,用于评价PID控制系统的控制系能,比最小方差控制最为评价基准更可靠(PID up to find the minimum variance control system for evaluation of PID control system can be more than the minimum variance control most reliable evaluation criteria)
    2013-12-17 20:42:34下载
    积分:1
  • roc1
    roc曲线绘制程序 关于检测阈值的函数曲线(Roc curve drawing program roc curve is a function of detection threshold curve)
    2020-09-22 15:07:54下载
    积分:1
  • VC-and-matlab
    这里介绍了VC与matlab的简单联合运用,初步学会结合(Here are the simple joint use of the VC and Matlab, initially learned to combine)
    2012-05-21 18:53:08下载
    积分:1
  • 最大二分配法
    如果G的边集E(G)中有个子集M,满足M中的任何两条边 都不邻接,则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配,最大匹配所包含的边数称为最大匹配数。当 G是二分图时,问题就比较特殊了,这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)
    2021-01-20 10:38:41下载
    积分:1
  • imread
    灰度图象的直方图均衡化;梯度;直方图规定化;灰度图象的直方图数据;灰度直接变换:增强对比度(gray image histogram equalization; Gradient; Histogram provisions; Gray image histogram data; Gray direct transformation : Enhanced Contrast)
    2007-04-26 23:17:31下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载