Abstract
We present a genetic algorithm (GA) which uses a normalized postfix encoding scheme to solve the VLSI floorplanning problem. We claim to have overcome the representational problems previously associated with encoding postfix expressions into GAs, and have developed a novel encoding system which preserves the integrity of solutions under all the genetic operators. Optimal floorplans axe obtained for module sets taken from some MCNC benchmarks. The slicing tree construction process, used by our GA to generate the floorplans, has a run time scaling which compares very favourably with other recent approaches.
Cite
CITATION STYLE
Valenzuela, C. L., & Wang, P. Y. (2000). A genetic algorithm for vlsi floorplanning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1917, pp. 671–680). Springer Verlag. https://doi.org/10.1007/3-540-45356-3_66
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
