Sciweavers

93 search results - page 8 / 19
» A Survey on Approximation Algorithms for Scheduling with Mac...
Sort
View
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 7 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
FORTE
2008
13 years 9 months ago
Detecting Communication Protocol Security Flaws by Formal Fuzz Testing and Machine Learning
Network-based fuzz testing has become an effective mechanism to ensure the security and reliability of communication protocol systems. However, fuzz testing is still conducted in a...
Guoqiang Shu, Yating Hsu, David Lee
FSTTCS
2007
Springer
14 years 1 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
ICALP
2007
Springer
14 years 1 months ago
Mechanism Design for Fractional Scheduling on Unrelated Machines
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
George Christodoulou, Elias Koutsoupias, Annam&aac...
STACS
2009
Springer
14 years 2 months ago
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
Tomás Ebenlendr, Jiri Sgall