partitioning by probability condensation
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 .
partition probability model component functional minimal value case