Modeling Idealized Parallel Genetic Algorithms
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [4]
  • |
  • Related [20]
  • |
  • Cited by [9]
  • | |
  • Comments
    Reference
    [1]  Cantú-Paz E. A Survey of Parallel Genetic Algorithms. Urbana-Cha mpaign: Illinois Genetic Algorithms Laboratory, 1996
    [2]  Harik G, Cantú-Ppaz E, Goldberg D E et al. The Gambler's ru in problem, genetic algorithms, and the sizing of populations. In: Back T ed. Pr oceedings of IEEE Conference'97 on Evolutionary Computation. New York: IEEE Pres s, 1997. 7~12
    [3]  Cantú-Paz E, Goldberg D E. Modeling idealized bounding cases of parallel genetic algorithms. In: Koza J et al eds. Genetic Programm ing 1997: Proceedings of the 2nd Annual Conference. San Francisco: Morgan Kaufma nn Publishers, 1997. 353~361
    [4]  Miller B L. Noise, sampling and efficient genetic algorithms [Ph.D.Thesis ]. Urbana-Champaign: University of Illinois, 1997
    Comments
    Comments
    分享到微博
    Submit
Get Citation

侯广坤,骆江鹏.一种理想并行遗传算法模型.软件学报,1999,10(5):557-560

Copy
Share
Article Metrics
  • Abstract:3527
  • PDF: 310
  • HTML: 0
  • Cited by: 0
History
  • Received:November 20,1997
  • Revised:May 04,1998
You are the first2032699Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063