Andere Kunden interessierten sich auch für
![An Approach to Solve MMKP: Using Genetic Algorithm]( "An Approach to Solve MMKP: Using Genetic Algorithm")
An Approach to Solve MMKP: Using Genetic Algorithm33,99 €![Methodology to Develop Depth Classification Scheme for Physics]( "Methodology to Develop Depth Classification Scheme for Physics")
Methodology to Develop Depth Classification Scheme for Physics44,99 €![Hybridization of Genetic Algorithm and K Nearest Neighbor Classifier]( "Hybridization of Genetic Algorithm and K Nearest Neighbor Classifier")
Hybridization of Genetic Algorithm and K Nearest Neighbor Classifier37,99 €![Parallel Single and Multi-objective Genetic Algorithm in Datamining]( "Parallel Single and Multi-objective Genetic Algorithm in Datamining")
Parallel Single and Multi-objective Genetic Algorithm in Datamining56,99 €![Studies On Shortest Path Using Genetic Algorithm]( "Studies On Shortest Path Using Genetic Algorithm")
Studies On Shortest Path Using Genetic Algorithm35,99 €![DNA Computing used to Solve Path Problems with Conditions]( "DNA Computing used to Solve Path Problems with Conditions")
DNA Computing used to Solve Path Problems with Conditions25,99 €![Temporal Weather Prediction using Genetic Algorithm]( "Temporal Weather Prediction using Genetic Algorithm")
Temporal Weather Prediction using Genetic Algorithm27,99 €
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.