By Topic

Neighbour state transition method for VLSI optimization problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. Zhou ; EE Dept., Univ. of North Carolina, Charlotte, NC, USA ; F. Tsui

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