Sciweavers

APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 7 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
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...
Rajiv Gandhi, Julián Mestre
157
Voted
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 7 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 7 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
CAV
2004
Springer
136views Hardware» more  CAV 2004»
15 years 7 months ago
JNuke: Efficient Dynamic Analysis for Java
JNuke is a framework for verification and model checking of Java programs. It is a novel combination of run-time verification, explicit-state model checking, and counter-example ex...
Cyrille Artho, Viktor Schuppan, Armin Biere, Pasca...