Optimal scheduling of contract algorithms for anytime problem-solving

DOI10.1613/JAIR.4360MaRDI QIDQ2929590zbMATH OpenOpenAlexFDO

Authors Spyros Angelopoules, Alejandro Lopez-Ortiz, Angèle. M. Hamel

Publication date 13 November 2014

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.4360

Mathematics Subject Classification ID

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)

Recommendations

• Optimal scheduling of contract algorithms with soft deadlines
• Interruptible algorithms for multiproblem solving
• Optimal sequencing of contract algorithms
• Multi-processor search and scheduling problems with setup cost
• scientific article; zbMATH DE number 2000819

Cited in

(10)

• Optimal sequencing of contract algorithms
• A contracting model for flexible distributed scheduling
• Further connections between contract-scheduling and ray-searching problems
• Interruptible algorithms for multiproblem solving
• Multi-processor search and scheduling problems with setup cost
• Optimal scheduling of contract algorithms with soft deadlines
• scientific article; zbMATH DE number 2000819 (Why is no real title available?)
• Weighted online search
• Contract scheduling with predictions
• Online computation with untrusted advice

This page was built for publication: Optimal scheduling of contract algorithms for anytime problem-solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929590)