登录
首页 » PDF » J68

J68

于 2014-08-21 发布 文件大小:1336KB
0 289
下载积分: 1 下载次数: 14

代码说明:

  optimum placement of DG

文件列表:

J68.pdf,1410891,2014-08-11

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

发表评论

0 个回复

  • sift
    SIFT算法,用MATLAB编写,不错的参考资料(SIFT algorithm, using MATLAB to prepare, a good reference)
    2008-03-18 16:12:50下载
    积分:1
  • Dcmodel
    dc motor model in simulink
    2013-12-20 14:20:57下载
    积分:1
  • zaiji_jidong
    雷达仿真程序并用Matlab仿真,雷达仿真程序并用Matlab仿真(Radar simulation and use Matlab simulation, radar simulation and simulation using Matlab)
    2010-11-02 21:26:02下载
    积分:1
  • control
    智能控制第二版仿真程序,内含各个章节的matlab程序(The second edition of intelligent control simulation program, each chapter contains matlab program)
    2015-01-17 19:19:09下载
    积分:1
  • MATLAB
    详细介绍了MATLAB平台中设计的方法与步骤,并进行了一些简单程序的编写过程(Detailed information on MATLAB platform design methods and steps, and carried out some simple procedures for the preparation of)
    2008-04-12 19:31:30下载
    积分:1
  • AmbiguityFun
    画雷达信号的模糊函数,包括单脉冲信号、线性调频信号。(The painting of the ambiguity function of radar signals, including the single-pulse signal, linear frequency modulation signal.)
    2012-05-05 10:46:35下载
    积分:1
  • 20075417291016997
    matlab的一些应用程序,适合有一定基础的人使用 (Matlab some applications, a basis for the use of)
    2007-05-10 14:00:49下载
    积分:1
  • showwindow
    A simple message window similar to msgbox without button,转载(A simple message window similar to msgbox without button, reprint)
    2007-07-18 16:08:39下载
    积分:1
  • dijikstra
    For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
    2012-04-12 21:01:48下载
    积分:1
  • biyesheji3
    毕业设计的代码,如果你也为此恼火的话,可以看一下。(Graduate design code, if you do this annoyed, you can look at.)
    2013-04-27 20:03:07下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载