Cart (Loading....) | Create Account
Close category search window
 

Application of evolutionary algorithm to three key problems in VLSI layout

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

4 Author(s)
Guo-Fang Nan ; Inst. of Syst. Eng., Tianjin Univ., China ; Min-Qiang Li ; Dan Lin ; Ji-Song Kou

Evolutionary algorithm is a class of stochastic search algorithm, which can be applied to both combinatorial and numerical optimization problems, especially NP hard problems. Circuit partitioning, placement and clock routing are three key phases in VLSI physical design and they are proved to be NP hard. So a genetic algorithm frame and its realization process are presented in this paper in order to solve these problems. Meanwhile, this algorithm is used to test different benchmarks for three different problems, experimental results show that it is a feasible and valid algorithm. This genetic algorithm can also improve solutions when compared with traditional heuristic methods.

Published in:

Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on  (Volume:5 )

Date of Conference:

18-21 Aug. 2005

Need Help?


IEEE Advancing Technology for Humanity 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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.