DocumentCode
1950171
Title
Hill climbing with reduced search space (logic optimization)
Author
Brand, D.
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fYear
1988
fDate
7-10 Nov. 1988
Firstpage
294
Lastpage
297
Abstract
A general optimization algorithm, which in some areas successfully competes with simulated annealing and the Kernighan-Lin algorithm, as well as special heuristics, is presented. It gains speed by taking advantage of the structure of the objective function in order to reduce the search space. Results obtained from the implementation of the algorithm on three problems are presented.<>
Keywords
logic CAD; optimisation; Kernighan-Lin algorithm; general optimization algorithm; hill climbing; logic optimization; objective function; search space; simulated annealing; special heuristics; Crystals; Graph theory; Logic; Minimization methods; Optimization methods; Partitioning algorithms; Polynomials; Simulated annealing; Temperature dependence; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer-Aided Design, 1988. ICCAD-88. Digest of Technical Papers., IEEE International Conference on
Conference_Location
Santa Clara, CA, USA
Print_ISBN
0-8186-0869-2
Type
conf
DOI
10.1109/ICCAD.1988.122514
Filename
122514
Link To Document