The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1992 vol.25)
pp: 27-36
ABSTRACT
<p>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.</p>
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
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool