Fortæl dine venner om denne vare:
A Genetic Algorithm Scheme to Solve Complex Triangle Problem
Swapan Kumar Samaddar
Bestilles fra fjernlager
A Genetic Algorithm Scheme to Solve Complex Triangle Problem
Swapan Kumar Samaddar
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.
Medie | Bøger Paperback Bog (Bog med blødt omslag og limet ryg) |
Udgivet | 29. januar 2013 |
ISBN13 | 9783659334436 |
Forlag | LAP LAMBERT Academic Publishing |
Antal sider | 76 |
Mål | 150 × 5 × 226 mm · 122 g |
Sprog | Engelsk |
Se alt med Swapan Kumar Samaddar ( f.eks. Paperback Bog )