Sciweavers

2057 search results - page 334 / 412
» Quadratic placement using an improved timing model
Sort
View
CONSTRAINTS
2011
15 years 1 months ago
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
Pierre Schaus, Pascal Van Hentenryck, Jean-Noë...
MOBIHOC
2009
ACM
16 years 6 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu
EDBT
2004
ACM
147views Database» more  EDBT 2004»
16 years 6 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
DAC
2005
ACM
16 years 7 months ago
Robust gate sizing by geometric programming
We present an efficient optimization scheme for gate sizing in the presence of process variations. Using a posynomial delay model, the delay constraints are modified to incorporat...
Jaskirat Singh, Vidyasagar Nookala, Zhi-Quan Luo, ...
176
Voted
IWDC
2001
Springer
145views Communications» more  IWDC 2001»
15 years 10 months ago
Activating and Deactivating Repair Servers in Active Multicast Trees
Abstract. For time-constrained applications, repair-server-based active local recovery approaches can be valuable in providing low-latency reliable multicast service. However, an a...
Ping Ji, James F. Kurose, Donald F. Towsley