6 search results - page 2 / 2 » Faster Deterministic and Randomized Algorithms on the Homoge... |
112
click to vote
ALGORITHMICA
2004
15 years 2 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...