.png){kind=icon}
返回
Floating Steiner trees
.png){kind=icon}
PRE
AI
DOI：10.1109/12.663766.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the reproducing placement problem, which finds application in layout-driven logic synthesis. In each phase, a module (or gate) is decomposed into two (or more) simpler modules. The goal is to find a good placement in each phase. The problem, being iterative in nature, requires an iterative algorithm. In solving the RPP, we introduce the notion of minimum floating Steiner trees (MFST). We employ an MFST algorithm as a central step in solving the RPP. A Hanan-like theorem is established for the MFST problem, and two approximation algorithms are proposed. Experiments on commonly employed benchmarks verify the effectiveness of the proposed technique.
Keyword:
Steiner trees
exact algorithms
optimization
placement problem
gate level design
期刊
IF:
3.8
论文数:
5.3K
被引数:
9.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
Tula hantavirus NSs protein accumulates in the perinuclear area in infected and transfected cells
PREAI
分享收藏
分享收藏
分享收藏Prognostic value of myocardial perfusion imaging in predicting outcome after renal transplantation
PREAI
分享收藏
查看更多内容