DocumentCode
450705
Title
Partitioning by Probability Condensation
Author
Blanks, John
Author_Institution
Mentor Graphics Corporation
fYear
1989
fDate
25-29 June 1989
Firstpage
758
Lastpage
761
Abstract
A partitioning model is formulated in which components are assigned probabilities of being placed in bins separated by partitions. The expected number of nets crossing partitions is a quadratic function of these probabilities. Minimization of this expected value forces condensation of the probabilities into a "definite" state representing a very good partitioning. The bipartitioning case is treated explicitly.
Keywords
Distributed computing; Ellipsoids; Finishing; Graphics; Joining processes; Machinery; Permission; Probability distribution; Simulated annealing; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation, 1989. 26th Conference on
ISSN
0738-100X
Print_ISBN
0-89791-310-8
Type
conf
DOI
10.1109/DAC.1989.203504
Filename
1586488
Link To Document