Sciweavers

975 search results - page 96 / 195
» Locality Optimization for Program Instances
Sort
View
MDM
2009
Springer
123views Communications» more  MDM 2009»
14 years 4 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
HIPC
2007
Springer
14 years 3 months ago
Experiments with a Parallel External Memory System
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...
Mohammad R. Nikseresht, David A. Hutchinson, Anil ...
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 11 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
TCSV
2008
105views more  TCSV 2008»
13 years 9 months ago
Combination Load Balancing for Video-on-Demand Systems
We observe that an effect of "disk resource sharing" of multi-copy movie traffic has great impact on the blocking performance of a video-on-demand system. This observatio...
Jun Guo, Eric Wing Ming Wong, Sammy Chan, Peter Ta...
PODC
2005
ACM
14 years 3 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer