517 search results - page 5 / 104 » Approximation Algorithms for Scheduling with Reservations |
SIGMOD
2012
ACM
11 years 11 months ago
2012
ACM
Cloud computing has emerged as a promising environment capable of providing flexibility, scalability, elasticity, failover mechanisms, high availability, and other important feat...
DISOPT
2006
13 years 8 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
CPAIOR
2008
Springer
13 years 10 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
CPAIOR
2006
Springer
14 years 7 days ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
TON
2010
13 years 3 months ago
2010
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...