Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving
From MaRDI portal
Publication:2929590
DOI10.1613/jair.4360zbMath1367.68021OpenAlexW2128419582MaRDI QIDQ2929590
Spyros Angelopoules, Angèle M. Hamel, Alejandro López-Ortiz
Publication date: 13 November 2014
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.4360
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
Further connections between contract-scheduling and ray-searching problems ⋮ Optimal scheduling of contract algorithms with soft deadlines ⋮ Weighted online search ⋮ Interruptible algorithms for multiproblem solving
This page was built for publication: Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving
