828 search results - page 105 / 166 » Bounded Hairpin Completion |
116
click to vote
APPROX
2000
Springer
15 years 5 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
100
Voted
STOC
1999
ACM
15 years 4 months ago
1999
ACM
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
123
click to vote
COMGEO
2007
ACM
15 years 18 days ago
2007
ACM
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...
93
Voted
MST
2000
15 years 11 days ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
110
Voted
JSAC
2010
14 years 11 months ago
2010
—The advent of practical rateless codes enables implementation of highly efficient packet-level forward error correction (FEC) strategies for reliable data broadcasting in loss-...