Sciweavers

777 search results - page 52 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 9 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
SAINT
2005
IEEE
14 years 1 months ago
A Case Study in Running a Parallel Branch and Bound Application on the Grid
This paper presents a case study to effectively run a parallel branch and bound application on the Grid. The application discussed in this paper is a fine-grain application and is...
Kento Aida, Tomotaka Osumi
SPAA
1993
ACM
13 years 11 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
DATE
2005
IEEE
82views Hardware» more  DATE 2005»
14 years 1 months ago
Energy-Aware Routing for E-Textile Applications
As the scale of electronic devices shrinks, “electronic textiles” (e-textiles) will make possible a wide variety of novel applications which are currently unfeasible. Due to t...
Jung-Chun Kao, Radu Marculescu
ICALP
2007
Springer
14 years 1 months ago
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
Sudipto Guha, Andrew McGregor