# Interruptible Algorithms for Multiproblem Solving

26 Oct 2018Spyros AngelopoulosAlejandro Lopez-Ortiz

In this paper we address the problem of designing an interruptible system in a setting in which $n$ problem instances, all equally important, must be solved concurrently. The system involves scheduling executions of contract algorithms (which offer a trade-off between allowable computation time and quality of the solution) in m identical parallel processors... (read more)

PDF Abstract

No code implementations yet. Submit your code now