登录
首页 » Python » DE.python

DE.python

于 2011-04-25 发布 文件大小:4KB
0 108
下载积分: 1 下载次数: 40

代码说明:

  Python实现的差分进化算法源代码 使用Python实现的差分进化算法,引用到Numpy和Scipy,可以支持多核与集群并行计算。使用时只需继承DESolver并定义函数def error_func(self, indiv, *args)作为目标函数即可。(Python implementation of the differential evolution algorithm source code uses the Python implementation of the differential evolution algorithm, a reference to Numpy and Scipy, can support multi-core and parallel computing cluster. Just use the definition of Inheritance DESolver and function def error_func (self, indiv,* args) as the objective function can be.)

文件列表:

DE.python.txt,14966,2011-04-25

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

发表评论

0 个回复

  • rPm库的安装包 很好的希望大家喜欢有帮助的
    rPm数据库的安装包 很好的希望大家喜欢有帮助的-rpm database of installed packages good hope that we like to have help
    2022-02-18 17:06:10下载
    积分:1
  • out in the Grid, quite good!
    自动高速Grid的列数,蛮不错的呀!-out in the Grid, quite good!
    2022-02-04 07:15:40下载
    积分:1
  • xiande
    弗洛伊德算法计算有向网络图最短路问题。可算最短路径。(Freud algorithm to calculate the shortest path problem to the network diagram. Can be considered the shortest path.)
    2012-08-17 14:02:44下载
    积分:1
  • 包含图的遍历和线性链表两个内容,压缩文件里含有设计报告...
    包含图的遍历和线性链表两个内容,压缩文件里含有设计报告-Contains the graph traversal and linear chain of two elements, compressed file contains the design report
    2022-03-05 16:09:50下载
    积分:1
  • main
    求最长上升下降\非上升非下降的刷表法(Seeking maximum rise fall Philippines rise fall Philippines brush table method)
    2016-03-29 19:29:19下载
    积分:1
  • 常用的算法
    数据结构常用算法之一-Dijkstra算法,实现最短路径选择.-algorithm commonly used data structures one-Dijkstra algorithm to achieve the shortest path to choose.
    2023-07-11 21:50:02下载
    积分:1
  • 里面有很多有用的公式,很有利于算法的学习,希望与大家一起分享...
    里面有很多有用的公式,很有利于算法的学习,希望与大家一起分享-There are many useful formula for the learning algorithm
    2022-03-18 22:28:21下载
    积分:1
  • skiplist.c.tar
    A skip list is a data structure for storing a sorted list of items, using a hierarchy of linked lists that connect increasingly sparse subsequences of the items. These auxiliary lists allow item lookup with efficiency comparable to balanced binary search trees (that is, with number of probes proportional to log n instead of n).
    2011-04-20 12:59:03下载
    积分:1
  • 一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法,指出应在哪些加油站停靠加油,使沿途加油次最少。对于给定的n和k个加油站位置,编程计算最少...
    一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法,指出应在哪些加油站停靠加油,使沿途加油次数最少。对于给定的n和k个加油站位置,编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution
    2023-08-07 06:10:03下载
    积分:1
  • 最小生成树
    1 2 0.0403 1 3 0.4747 1 4 0.7015 1 5 0.7936 1 6 0.2973 1 7 0.6139 1 8 0.4494 1 9 0.3155 1 10 0.8558 1 11 0.272 1 12 0.1045 1 13 0.6548 1 14 0.9271 1 15 0.3229 2 1 0.2182 2 3 0.9329 2 4 0.9521 2 5 0.8128 2 6 0.4044 2 7 0.6619 2 8 0.6596 2 9 0.3007 2 10 0.7244 2 11 0.2316 2 12 0.01 2 13 0.915 2 14 0.0878 2 15 0.0984 3 1 0.967 3 2 0.8945 3 4 0.749 3 5 0.9038 3 6 0.3022 3 7 0.2 3 8 0.7532 3 9 0.042 3 10 0.1991 3 11 0.8995 3 12 0.0592 3 13 0.4332 3 14 0.3324 3 15 0.17 4 1 0.434 4 2 0.3857 4 3 0.5991 4 5 0.5404 4 6 0.7573 4 7 0.96 4 8 0.8047 4 9 0.5279 4 10 0.1573 4 11 0.9087 4 12 0.3227 4 13 0.2898 4 14 0.5262
    2022-12-31 18:30:14下载
    积分:1
  • 696524资源总数
  • 103896会员总数
  • 68今日下载