Abstract
A new cooling schedule is presented which is, unlike more traditional schedules, based on a fixed Markov-chain length and a variable decrement of the cooling control parameter. Cooling algorithms governed by this schedule can be executed in polynomial time. Comparison with the more traditional cooling schedules shows that the new schedule yields better results requiring less computational effort.
| Original language | English |
|---|---|
| Title of host publication | IEEE International Conference on Computer-aided Design, ICCAD-85 |
| Publisher | IEEE/LEOS |
| Pages | 206-208 |
| Number of pages | 3 |
| ISBN (Print) | 0818606878 |
| Publication status | Published - 1985 |