登录
首页 » matlab » AFSA-IEEE14

AFSA-IEEE14

于 2012-08-20 发布 文件大小:1KB
0 207
下载积分: 1 下载次数: 44

代码说明:

  人工鱼群,电力系统,仿真程序,IEEE14节点(Artificial fish, power system simulation program, the IEEE 14 node)

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

发表评论

0 个回复

  • miematlab
    mie理论的matlab源程序金属纳米粒子光散射的Mie 理论[附matlab源程序](mie theory of metal nanoparticles matlab source of Mie light scattering theory [attached matlab source])
    2010-06-04 17:09:25下载
    积分:1
  • kalman_guiji
    这是一种用于卡尔曼的非线性回归法的航迹跟踪算法。(This is a nonlinear regression for the Kalman tracking algorithm of track.)
    2010-06-29 20:05:55下载
    积分:1
  • F
    说明:  计算机视觉中基本矩阵F估计的matlab程序,很有用(F fundamental matrix in computer vision estimates matlab program, very useful)
    2011-03-24 21:40:46下载
    积分:1
  • Dynamic-simulation-of-machine
    Dynamic simulation of machineDynamic simulation of machine
    2012-08-21 09:22:56下载
    积分:1
  • PSOrbf
    NeuralNetworkRbf程序,很好很强大。肯定能用。(NeuralNetworkRbf)
    2010-12-16 14:40:38下载
    积分:1
  • DV_Hoplast
    说明:  这个是用matlab实现dvhop非基于测距的算法仿真(This is achieved using matlab dvhop simulation algorithms are not based on distance)
    2011-04-13 15:47:17下载
    积分:1
  • MIMLSVM
    matlab编写的MIMLSVM算法,可对多示例多标记样本进行分类,并计算正确率等多个评价指标,算法准确无误,可以运行,附有作为例子的数据和主程序。(matlab prepared MIMLSVM algorithms for multi-instance multi-label classification of samples and calculate the correct rate and other evaluation algorithm is accurate and can run with the data and the main program as an example.)
    2014-01-15 15:32:52下载
    积分:1
  • SMC_DCDC
    mo phong DC dc converter
    2009-11-04 22:25:33下载
    积分:1
  • gui-DxDraw
    一套非常精美的Gui封状接口源代码.非常之有意思.(a very attractive interface-Gui closed source code. Very interesting.)
    2007-02-12 11:51:48下载
    积分:1
  • Matlab_zuixiaoerchengfa
      最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
    2012-07-27 14:54:17下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载