期刊文献+

Massively Parallel SPMD Algorithm for Cluster Computing

Massively Parallel SPMD Algorithm for Cluster Computing -Combining Genetic Algorithm with Uphill
下载PDF
导出
作者 DU Zhi-hui
出处 《Journal of Shanghai University(English Edition)》 CAS 2001年第z1期10-14,共5页 上海大学学报(英文版)
  • 相关文献

参考文献12

  • 1[1]Hao Chen, Flann N. S. , Watson D. W. , Parallel genetic simulated annealing: a massively parallel SIMD algorithm,Parallel and Distributed Systems, 1998, 9(2): 126-136
  • 2[2]Du Zhihui, Li Sanli, Li Shuyou, et al., Massively parallel simulated annealing embedded with ownhill-a SPMD algorithm for cluster computing, IEEE International Workshop on Cluster Computing (IWCC99), IEEE Computer Society. Melbourne, Austria, 1999:279-302
  • 3[3]Garey, M.R., Johnson D. S., Computers and Intractability:A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979
  • 4[4]Herrera F., Verdegay J.L. (Editors.), Genetic Algorithm and Software Computing, Physica-Verlag Heidelberg, 1996
  • 5[5]Holland J.H., Adaption in Natural and Artificial Systems,University of Michigan Press, 1975 (Second edition:MIT Press, 1992)
  • 6[6]Ingber L., Rosen B., Genetic algorithms and very fast simulated re-annealing: a comparison, Mathematical Computer Modeling, 1992, 16(11):87
  • 7[7]Kirkpatrick S., Gelatt C.D., Vecchi M.P., Optimization by simulated annealing, Science, 1983, 220:671-680
  • 8[8]Davis L., Handbook of Genetic Algorithms, VanNostrand Reinhold, 1991
  • 9[9]Davis L. D., Jong K. De, Vose M. D., et al. editor,Evolutionary Algorithms, Springer, 1999
  • 10[10]Lundy M., Mess A., Convergence of an annealing algorithm,Mathematical Programming, 1986, 34:111-124

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部