Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources
Lev Finkelstein, Shaul Markovitch, Ehud Rivlin · 2003
The performance of anytime algorithms can be improved by simultaneously solving several instances of algorithm-problem pairs. These pairs may include di#erent instances of a problem (such as starting from a di#erent initial state), di#erent algorithms (if several alternatives exist), or several runs of the same algorithm (for non-deterministic algorithms).