Referenced Items are not available for this document.
A novel technique, called the neighbor state transition method, is introduced for solving a class of optimization problems often found in VLSI designs. The method utilizes the powerful means that have been developed for optimization in continuous space in order to solve optimization problems confined to discrete points. For two NP-hard problems, gate array placement and graph partitioning, the method produces an asymptotically global optimal solution in polynomial time
Published in:
Computer Design: VLSI in Computers and Processors, 1993. ICCD '93. Proceedings., 1993 IEEE International Conference on
Date of Conference: 3-6 Oct 1993
- Page(s):
- 476 - 479
- Meeting Date :
- 03 Oct 1993-06 Oct 1993
- Print ISBN:
- 0-8186-4230-0
- INSPEC Accession Number:
- 4955918
- Conference Location :
- Cambridge, MA
- Digital Object Identifier :
- 10.1109/ICCD.1993.393330
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
