Contract scheduling with predictions

DOI10.1613/JAIR.1.14117MaRDI QIDQ6488786

Spyros Angelopoulos, Shahin Kamali

Publication date: 23 October 2023

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

zbMATH Keywords

uncertaintyschedulingplanningresource-bounded reasoning

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Fault-tolerant search algorithms. Reliable computation with unreliable information
• Coping with errors in binary search procedures
• Deliberation scheduling for problem solving in time-constrained environments
• Optimal sequencing of contract algorithms
• Lower bounds for searching robots, some faulty
• Optimal composition of real-time systems
• Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving
• Algorithms with Predictions
• Competitive Caching with Machine Learned Advice
• Online Scheduling via Learned Weights
• Scheduling with Predictions and the Price of Misprediction
• Searching games with errors -- fifty years of coping with liars

This page was built for publication: Contract scheduling with predictions