A Genetic Algorithm Scheme to Solve Complex Triangle Problem - Softcover

Samaddar, Swapan Kumar

 
9783659334436: A Genetic Algorithm Scheme to Solve Complex Triangle Problem
Softcover
ISBN 10: 365933443X ISBN 13: 9783659334436
Publisher: LAP LAMBERT Academic Publishing, 2013

Synopsis

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.

"synopsis" may belong to another edition of this title.

About the Author

Swapan Kumar Samaddar is a Senior Associate in Genpact India, Kolkata. He did BTech (CSE) from Netaji Subhash Engineering College, Kolkata and later on did his ME (CSE) from West Bengal University of Technology, Kolkata. His research areas are Digital Signal Processing, Image Processing, Advanced computer architecture and parallel architecture.

"About this title" may belong to another edition of this title.

Publisher
LAP LAMBERT Academic Publishing
Publication date
2013
Language
English
ISBN 10 
365933443X
ISBN 13 
9783659334436
Binding
Paperback
Number of pages
76