Sciweavers

625 search results - page 118 / 125
» Semi-preemptive routing on trees
Sort
View
DAC
2009
ACM
14 years 8 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
DAC
2003
ACM
14 years 8 months ago
Multilevel floorplanning/placement for large-scale modules using B*-trees
We present in this paper a multilevel floorplanning/placement framework based on the B*-tree representation, called MB*-tree, to handle the floorplanning and packing for large-sca...
Hsun-Cheng Lee, Yao-Wen Chang, Jer-Ming Hsu, Hanna...
WWW
2009
ACM
14 years 8 months ago
A flight meta-search engine with metamorph
We demonstrate a flight meta-search engine that is based on the Metamorph framework. Metamorph provides mechanisms to model web forms together with the interactions which are need...
Bernhard Krüpl, Wolfgang Holzinger, Yansen Da...
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 7 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
VLDB
2004
ACM
152views Database» more  VLDB 2004»
14 years 7 months ago
Balancing energy efficiency and quality of aggregate data in sensor networks
In-network aggregation has been proposed as one method for reducing energy consumption in sensor networks. In this paper, we explore two ideas related to further reducing energy co...
Mohamed A. Sharaf, Jonathan Beaver, Alexandros Lab...