登录
首页 » matlab » yicuansuanfa-(2)

yicuansuanfa-(2)

于 2011-05-02 发布 文件大小:6KB
0 127
下载积分: 1 下载次数: 3

代码说明:

  遗传算法,能很好解决一系列不定向性问题效果很好(Genetic algorithm can solve a series of uncertain sexual problems very good results)

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

发表评论

0 个回复

  • pathplanning
    用matlab仿真实现单机器人的路径规划,比较简单易懂,对初学者的一个很好的资料(single robot path plan,which is a good material for a learing person)
    2011-09-09 16:28:41下载
    积分:1
  • calc_errors
    残差预测源代码 ARMA建模 差分 相关系数 阶数 (arma errors )
    2012-10-11 20:28:05下载
    积分:1
  • psomatlabprograme
    属性分类的粒子群算法Particle swarm optimization (pso) algorithm to the classification of the attribute(Particle swarm optimization (pso) algorithm to the classification of the attribute)
    2013-12-05 19:25:43下载
    积分:1
  • turbo2c
    The document contains a turbo code descrription
    2011-01-25 20:40:25下载
    积分:1
  • GP
    说明:  采用变长结构体编码的遗传规划及其在自适应建模中的应用(Encoded using variable-length structure of Genetic Programming and Its Application in Adaptive Modeling)
    2010-04-13 10:12:00下载
    积分:1
  • matchedlayer
    This program simulates wave propagation in a medium that has impedence matched between two slabs and hased been used Mur ABC for no reflection at two ends.
    2011-06-16 23:27:54下载
    积分:1
  • LTElianlufangzhen()
    LTE链路仿真 LTE链路仿真 LTE链路仿真(Link Simulation LTE LTE LTE link Link Simulation Simulation)
    2013-07-20 12:31:38下载
    积分:1
  • Matlab_zuixiaofeiyong
    最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of ​ ​ the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
    2012-07-27 14:55:22下载
    积分:1
  • lsb
    实现LSB数字图像水印算法,限于BMP图像(LSB digital image watermarking algorithm to achieve, limited to the BMP image)
    2010-09-13 15:37:10下载
    积分:1
  • SA-TSP
    基于经典的优化算法--模拟退火算法的旅行商问题寻优实现,该算法比较经典,可用于后续一些性能对比分析(The traveling salesman problem-- the classical optimization algorithms and simulated annealing algorithm is implemented based on the algorithm, compare the classic, can be used for the analysis of subsequent performance comparison)
    2013-10-04 11:03:38下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载