登录
首页 » matlab » best-function-of-PSO

best-function-of-PSO

于 2011-07-14 发布 文件大小:1KB
0 251
下载积分: 1 下载次数: 8

代码说明:

  基于标准的粒子群算法编写了一个简单通用的matlab程序,求解函数最优值(matlab code of standard particle swarm optimization,best value)

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

发表评论

0 个回复

  • OFDMAfangzhen
    说明:  很好OFDMA的matlab仿真程序,程序简明的对系统进行了仿真,OFDMA入门级资料(OFDMA of matlab simulation program well, the program simple system simulation, OFDMA entry-level data)
    2021-04-28 16:38:43下载
    积分:1
  • refDeref
    This program is testing referencing and dereferencing
    2014-09-05 14:55:34下载
    积分:1
  • Matlab-programming-entry-routines
    matlab基础与编程入门(第二版)相配套的例程,适合初学者(matlab basic and introductory programming (Second Edition) matching routines, suitable for beginners)
    2015-03-16 09:48:08下载
    积分:1
  • imcredit
    可以在matlab图的下方给出图像标注。matlab的title命令只能在图像的上方标注图标(in Matlab is at the bottom of the map image tagging. Matlab can order the title in the above image tagging icon)
    2007-05-31 16:43:40下载
    积分:1
  • 1
    基于matlab的模块化通信系统仿真设计,以及实验报告(this is a design of engineer system modulation based on matlab2012b)
    2013-08-30 16:49:34下载
    积分:1
  • sin_ruili_awgn_sim_roc
    利用正弦信号作为发射信号,分别在AWGN和瑞利信道中,计算CR中的检测概率和虚警概率,并绘图。(Sinusoidal signal as transmitted signal, respectively, in AWGN and Rayleigh channel, calculate the probability of detection and false alarm probability of CR and drawing.)
    2014-02-18 11:20:23下载
    积分:1
  • Matlabprogrammingcalculatedusingtheshortestpathand
    利用Matlab编程计算最短路径及中位点选址(Calculated using Matlab programming shortest path and site location)
    2008-05-24 14:11:22下载
    积分:1
  • OFDM_matlab
    ofdm 关于系统仿真的源程序代码 matlab(Ofdm matlab source system simulation program)
    2012-05-05 15:11:23下载
    积分:1
  • formulaCurl
    Derive for the element stiffness with symbol calculation in Matlab
    2010-01-07 07:05:32下载
    积分:1
  • cebk_tsp
    用离散数学或图论的术语来说,假设有一个图g=(v,e),其中v是顶点集,e是边集,设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵,旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 (Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
    2011-05-22 08:12:37下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载