SOLVING TASK ALLOCATION PROBLEM ON BOLTZMANN MACHINES
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [1]
  • |
  • Related
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    This paper presents an algorithm of task allocation problem using Boltzmann machines. This algorithm is simulated parallelly in Transputer multiprocessor system. It is characterized with high optimization degree and computation speed.

    Reference
    1 Kirkpatrick S,Gelalt C D,Jr M P.Vechi optimization by simulated annealing science.1983;220(4598). 2 Aarts B H L,Korst J H M.Boltzmann machines for TSPs.European Journal of Operational Research。1989:39.
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

张德富,顾卫刚.用Boltzmann网络解任务安排问题.软件学报,1994,5(4):49-52

Copy
Share
Article Metrics
  • Abstract:3660
  • PDF: 4486
  • HTML: 0
  • Cited by: 0
History
  • Received:August 28,1991
  • Revised:December 17,1991
You are the first2045023Visitors
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