13 search results - page 2 / 3 » Semi-Online Preemptive Scheduling: One Algorithm for All Var... |
SPAA
2010
ACM
13 years 5 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
ESA
2009
Springer
14 years 2 days ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
ASIACRYPT
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. The security of the alleged RC4 stream cipher and some variants is investigated. Cryptanalytic algorithms are developed for a known plaintext attack where only a small se...