147 search results - page 15 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
105
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
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...
AIPS
2004
15 years 1 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
131
click to vote
TMC
2010
14 years 6 months ago
2010
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
EOR
2007
14 years 11 months ago
2007
: New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, a...
STOC
2002
ACM
16 years 8 hour ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...