This book provides a scheme based on genetic algorithm (GA) to solve the complex triangle elimination (CTE) problem of rectangular dualization approach in VLSI floor planning. Rectangular dualization, where each module is realized as a rectangular area, is an important approach in VLSI floor planning. It is known that if the input adjacency graph contains a complex triangle (CT), i.e. a cycle of three edges that is not a face, and then its rectangular dual does not exists. Elimination of CTs therefore becomes essential ...
Read More
This book provides a scheme based on genetic algorithm (GA) to solve the complex triangle elimination (CTE) problem of rectangular dualization approach in VLSI floor planning. Rectangular dualization, where each module is realized as a rectangular area, is an important approach in VLSI floor planning. It is known that if the input adjacency graph contains a complex triangle (CT), i.e. a cycle of three edges that is not a face, and then its rectangular dual does not exists. Elimination of CTs therefore becomes essential before constructing a floor plan. There are two versions of the CTE problems -weighted and unweighted adjacency graphs. The weighted CTE problem is known to be NP-complete (Sun, 1993). Recently it has been proved that unweighted problem is also NP-complete. In this paper we present a genetic algorithmic scheme to solve unweighted CTE problem and weighted CTE problem.
Read Less
Add this copy of A Genetic Algorithm Scheme to Solve Complex Triangle to cart. $86.88, new condition, Sold by Media Smart rated 4.0 out of 5 stars, ships from Hawthorne, CA, UNITED STATES, published 2013 by VDM Verlag Dr. Mueller Aktiengesellschaft & Co. KG.
Add this copy of A Genetic Algorithm Scheme to Solve Complex Triangle to cart. $108.67, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 2013 by LAP LAMBERT Academic Publishin.