Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. An efficient algorithm for circuit partitioning
Loading...
Thumbnail Image

An efficient algorithm for circuit partitioning

Author(s)
Yodtean, Apiradee
Choomchuay, Somsak
Suzuki, Yasoji
Date Issued
December 1, 1999
Type
Conference Paper
Abstract
This paper describes an improved simulated annealing algorithm applied for graph balanced bipartitioning problem, in particular for circuit partitioning problem. The new algorithm has incorporated the idea and procedure required in a genetic algorithm Experiment results on industrial benchmark circuits show that the proposed algorithm is superior to a conventional simulated annealing algorithm in both cut cost and run time.
Citation
International Symposium on IC Technology Systems and Applications, 8, 359-362, 1999
Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback