22 March 1996 HDBE: an efficient algorithm toward global optimizing
Author Affiliations +
Proceedings Volume 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics; (1996) https://doi.org/10.1117/12.235557
Event: Fourth International Conference on Computer-Aided Design and Computer Graphics, 1995, Wuhan, China
Abstract
In order to improve the global effect of placement, we introduce an efficient and fast algorithm. The main idea of this algorithm is that: the layout area is hierarchically decomposed into blocks. At each level of the decomposition, the cells in the block exchange at the same time. The min-cut exchange in the block hierarchy tree prevents local optimum solutions, as well as reduce the number of exchanges. Several questions are discussed about the algorithm. The time complexion is proved to be o(n).
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sikun Li, Sikun Li, Hong Wang, Hong Wang, } "HDBE: an efficient algorithm toward global optimizing", Proc. SPIE 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics, (22 March 1996); doi: 10.1117/12.235557; https://doi.org/10.1117/12.235557
PROCEEDINGS
5 PAGES


SHARE
RELATED CONTENT

A web QoS strategy based on session for web cluster...
Proceedings of SPIE (February 19 2006)
Applying case-based reasoning to macro cell layout
Proceedings of SPIE (March 21 1996)
Hyperspheres of N-sequence distances
Proceedings of SPIE (April 08 1993)
Recursive ULV decomposition
Proceedings of SPIE (November 12 2000)

Back to Top