Sciweavers

27 search results - page 1 / 6
» Fully polynomial time approximation schemes for stochastic d...
Sort
View
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
13 years 6 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...
DAC
2009
ACM
14 years 5 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
13 years 11 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
14 years 1 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
JCO
2011
115views more  JCO 2011»
12 years 11 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu