DocumentCode
3150071
Title
Performance of Algorithms for Initial Placement
Author
Palczewski, Michael
Author_Institution
Solomon Design Automation Corp., Santa Clara, CA
fYear
1984
fDate
25-27 June 1984
Firstpage
399
Lastpage
404
Abstract
This paper analyzes the performance of a commonly used class of methods for initial placement and describes several new classes. The classification in this paper is based on common methods of problem-solving used in artificial intelligence (AI) approaches. The paper does not describe the details of algorithms; instead it focuses on the qualitative performance.
Keywords
branch-and-bound; forward and backward reasoning; irrevocable and tentative search; lower and upper bounds; means-ends analysis; solution space; virtual placement; Artificial intelligence; Design automation; Design methodology; Educational institutions; Performance analysis; Problem-solving; Switches; Timing; Tree data structures; Upper bound; branch-and-bound; forward and backward reasoning; irrevocable and tentative search; lower and upper bounds; means-ends analysis; solution space; virtual placement;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation, 1984. 21st Conference on
ISSN
0738-100X
Print_ISBN
0-8186-0542-1
Type
conf
DOI
10.1109/DAC.1984.1585828
Filename
1585828
Link To Document