517 search results - page 15 / 104 » Approximation Algorithms for Scheduling with Reservations |
143
click to vote
EOR
2007
14 years 9 months ago
2007
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
EUROSYS
2008
ACM
14 years 11 months ago
2008
ACM
Guaranteed I/O performance is needed for a variety of applications ranging from real-time data collection to desktop multimedia to large-scale scientific simulations. Reservations...
JSC
2006
14 years 9 months ago
2006
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
SODA
1997
ACM
14 years 11 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
FCS
2008
14 years 11 months ago
2008
Abstract. Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their t...