16 search results - page 3 / 4 » A randomized scheduler with probabilistic guarantees of find... |
SODA
2001
ACM
13 years 7 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
SIGMETRICS
2006
ACM
14 years 6 days ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
CI
2004
13 years 6 months ago
2004
We consider automated decision aids that help users select the best solution from a large set of options. For such tools to successfully accomplish their task, eliciting and repre...
MOBISYS
2007
ACM
14 years 5 months ago
2007
ACM
The ease of deployment of battery-powered and mobile systems is pushing the network edge far from powered infrastructures. A primary challenge in building untethered systems is of...