Login / Signup
Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving.
Alejandro López-Ortiz
Spyros Angelopoulos
Angèle M. Hamel
Published in:
J. Artif. Intell. Res. (2014)
Keyphrases
</>
contract algorithms
optimal scheduling
scheduling problem
parallel processors
precedence constraints
np hard
parallel machines
tabu search
scheduling algorithm
anytime algorithms
information gathering
computational complexity
response time