By Topic

A new and efficient partitioning algorithm: genetic partitioning

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
$31 $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)
Lin-Ming Jin ; Circuits & Syst. Res. Lab., Santa Clara Univ., CA, USA ; Chan, S.-P.

A novel and efficient partitioning algorithm, called genetic partitioning, utilizing genetic algorithms is presented. Genetic partitioning has the capability of (1) climbing uphill with respect to the best solution and (2) implicit parallel processing due to population inherent in genetic algorithms. Two circuits are examined. The results of the first circuit are optimal in 85% of the cases when compared with those obtained using the exhaustive search approach. Genetic partitioning is competitive with simulated annealing in speed, as verified by the second circuit

Published in:

Circuits and Systems, 1991., Proceedings of the 34th Midwest Symposium on

Date of Conference:

14-17 May 1991