2714 search results - page 76 / 543 » Approximation Schemes for Scheduling |
100
click to vote
SIAMDM
2002
15 years 6 days ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
130
Voted
LION
2009
Springer
15 years 7 months ago
2009
Springer
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
104
Voted
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
113
Voted
AAIM
2006
Springer
15 years 6 months ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
105
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...