DocumentCode
3553690
Title
Performance of a new annealing schedule
Author
Lam, Jimmy ; Delosme, Jean-Marc
Author_Institution
Yale Univ., New Haven, CT, USA
fYear
1988
fDate
12-15 June 1988
Firstpage
306
Lastpage
311
Abstract
A simulated annealing schedule is derived. Its application to the standard cell placement and the traveling salesman problems results in a two to twenty-four times speedup over annealing schedules currently available in the literature. Since it uses only statistical quantities, the annealing schedule is applicable to general combinatorial optimization problems.<>
Keywords
annealing; circuit layout CAD; digital simulation; electrical engineering computing; integrated circuit technology; optimisation; combinatorial optimization problems; integrated circuit layout; simulated annealing schedule; standard cell placement; statistical quantities; traveling salesman problems; Application software; Computational modeling; Computer science; Computer simulation; Control systems; Cost function; Processor scheduling; Simulated annealing; Temperature control; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 1988. Proceedings., 25th ACM/IEEE
Conference_Location
Anaheim, CA, USA
ISSN
0738-100X
Print_ISBN
0-8186-0864-1
Type
conf
DOI
10.1109/DAC.1988.14775
Filename
14775
Link To Document