accounting for recent changes of gain in dealing with ties in iterative methods for circuit partitioning
Clicks: 95
ID: 179808
2015
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
28.2
/100
95 views
20 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #172 of 266 articles by views in Journal of the American Heart Association
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 266 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
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 have a considerable impact on performance. By considering the
most recent change in the potential reduction in cut size associated with moving each module
between subsets, the performance of this LIFO (last-in first-out) approach can be significantly
improved.
| Reference Key |
kim2015discreteaccounting
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Yong-Hyuk Kim;Yourim Yoon |
| Journal | Journal of the American Heart Association |
| Year | 2015 |
| DOI |
10.1155/2015/162050
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.