A number of pitfalls of empirical scheduling research are illustrated using real experimental data. These pitfalls, in general, serve to slow the progress of scheduling research b...
J. Christopher Beck, Andrew J. Davenport, Mark S. ...
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
In this paper, we demonstrate that the performance of a motif discovery algorithm can be significantly improved by embedding it into a novel framework that effectively guides the ...
We present an algorithm for updating the PageRank vector [1]. Due to the scale of the web, Google only updates its famous PageRank vector on a monthly basis. However, the Web chan...