Samenvatting
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.
| Originele taal-2 | Engels |
|---|---|
| Titel | IEEE International Conference on Computer-aided Design, ICCAD-85 |
| Uitgeverij | IEEE/LEOS |
| Pagina's | 206-208 |
| Aantal pagina's | 3 |
| ISBN van geprinte versie | 0818606878 |
| Status | Gepubliceerd - 1985 |