Sciweavers

4 search results - page 1 / 1
» Fast algorithms for slew constrained minimum cost buffering
Sort
View
DAC
2006
ACM
14 years 5 months ago
Fast algorithms for slew constrained minimum cost buffering
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...
Shiyan Hu, Charles J. Alpert, Jiang Hu, Shrirang K...
DAC
2007
ACM
14 years 5 months ago
Fast Min-Cost Buffer Insertion under Process Variations
Process variation has become a critical problem in modern VLSI fabrication. In the presence of process variation, buffer insertion problem under performance constraints becomes mo...
Ruiming Chen, Hai Zhou
CIC
2004
118views Communications» more  CIC 2004»
13 years 5 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
MOBIHOC
2008
ACM
14 years 4 months ago
Fast and quality-guaranteed data streaming in resource-constrained sensor networks
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
Emad Soroush, Kui Wu, Jian Pei