82 search results - page 8 / 17 » Preemptive Online Scheduling: Optimal Algorithms for All Spe... |
ANOR
2010
14 years 8 months ago
2010
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
AAAI
2004
14 years 11 months ago
2004
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
ASIAN
2004
Springer
15 years 3 months ago
2004
Springer
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
CN
2008
14 years 9 months ago
2008
Electrical-to-optical domain conversions and vice versa (denoted by O/E/O conversions) for each hop in optical core transport networks impose considerable capital and financial ov...
INFOCOM
2005
IEEE
15 years 3 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...