Accounting for Recent Changes of Gain in Dealing with Ties in Iterative Methods for Circuit Partitioning
In iterative methods for partitioning circuits, there is often a choice among several modules which will all produce the largest available reduction in cut size if they are moved between subsets in the partition. This choice, which is usually made by popping modules off a stack, has been shown to ha...
Main Authors: | Yong-Hyuk Kim, Yourim Yoon |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2015/162050 |
Similar Items
-
Moving Clusters within a Memetic Algorithm for Graph Partitioning
by: Inwook Hwang, et al.
Published: (2015-01-01) -
A New Iterative Refinement Technique for Circuit Partitioning
by: Kang, Szu-Sheng, et al.
Published: (1998) -
Two-Way Circuit Partitioning by Iterative Improvement and Logic Perturbation
by: Ming-Feng Shen, et al.
Published: (1999) -
Linkage-Based Distance Metric in the Search Space of Genetic Algorithms
by: Yong-Hyuk Kim, et al.
Published: (2015-01-01) -
Gene-Similarity Normalization in a Genetic Algorithm for the Maximum <i>k</i>-Coverage Problem
by: Yourim Yoon, et al.
Published: (2020-04-01)