Interruptible algorithms for multiproblem solving
DOI10.1007/s10951-020-00644-9zbMath1446.90070arXiv1810.11291OpenAlexW3006484948MaRDI QIDQ2197326
Alejandro López-Ortiz, Spyros Angelopoulos
Publication date: 31 August 2020
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.11291
contract algorithmsacceleration ratiointerruptible algorithmsanytime computationperformance measures in schedulingscheduling problems in artificial intelligence
Deterministic scheduling theory in operations research (90B35) 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
- Search games
- Optimal sequencing of contract algorithms
- The theory of search games and rendezvous.
- Optimal scheduling of contract algorithms with soft deadlines
- Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving
- The Oil Searching Problem
- Hyperbolic Dovetailing
- Bounds for Certain Multiprocessing Anomalies
- Lower bounds in on-line geometric searching
- Algorithm portfolios
This page was built for publication: Interruptible algorithms for multiproblem solving