This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Very High Speed Architecture for Simulated Annealing
May 1992 (vol. 25 no. 5)
pp. 27-36

A class of scheduling problems that can be modeled by using very simple cost measures, namely, counting costs and distance-measure costs, is presented. These measures can be incorporated into a simulated annealing algorithm, providing a robust system for solving such scheduling problems. A special-purpose computer architecture that supports the simulated annealing of such problems is described. This architecture provides speeds greatly surpassing those of conventional workstations and supercomputers using the same algorithm.

Citation:
David Abramson, "A Very High Speed Architecture for Simulated Annealing," Computer, vol. 25, no. 5, pp. 27-36, May 1992, doi:10.1109/2.144393
Usage of this product signifies your acceptance of the Terms of Use.