206 search results - page 11 / 42 » Better Bounds for Online Scheduling |
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
ECRTS
2010
IEEE
13 years 7 months ago
2010
IEEE
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiprocessor platforms. Results have been obtained that bound the ma...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
ETT
2000
13 years 7 months ago
2000
This paper considers all-optical broadcast networks providing a number of slotted WDM channels for packet communications. Each network user is equipped with one tunable transmitter...
AAAI
2008
13 years 10 months ago
2008
This paper summarizes recent work reported at ICAPS on applying artificial intelligence techniques to the control of production printing equipment. Like many other real-world appl...