Sciweavers

147 search results - page 14 / 30
» An optimal lower bound for anonymous scheduling mechanisms
Sort
View
ICALP
2007
Springer
15 years 5 months ago
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
ICALP
2009
Springer
15 years 6 months ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 3 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
RTAS
2003
IEEE
15 years 5 months ago
A Cyclic-Executive-Based QoS Guarantee over USB
Universal Serial Bus (USB) is a popular standard for PC peripheral devices because of its versatile peripheral interconnection specifications. USB not only provides simplified h...
Chih-Yuan Huang, Li-Pin Chang, Tei-Wei Kuo
GI
2009
Springer
14 years 9 months ago
Constraint-Based Task Scheduling with Sequence Dependent Setup Times, Time Windows and Breaks
Abstract: The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respe...
Armin Wolf