Sciweavers

38 search results - page 2 / 8
» Cost Based Query Scrambling for Initial Delays
Sort
View
CIC
2004
118views Communications» more  CIC 2004»
13 years 6 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
PVLDB
2011
12 years 7 months ago
Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores
Adaptive indexing is characterized by the partial creation and refinement of the index as side effects of query execution. Dynamic or shifting workloads may benefit from prelimi...
Stratos Idreos, Stefan Manegold, Harumi A. Kuno, G...
INFOCOM
2006
IEEE
13 years 10 months ago
Controlled Flooding Search with Delay Constraints
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...
Nicholas B. Chang, Mingyan Liu
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
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