Optimal sequencing of contract algorithms
From MaRDI portal
Publication:1397234
DOI10.1023/A:1024412831598zbMath1045.68129OpenAlexW1485548214MaRDI QIDQ1397234
Philippe Chassaing, Shlomo Zilberstein, François Charpillet
Publication date: 27 July 2003
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1024412831598
flexible computationmeta-level controlmathematical foundationreal-time problem solvingcontract algorithms
Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (8)
Further connections between contract-scheduling and ray-searching problems ⋮ Multi-processor search and scheduling problems with setup cost ⋮ Optimal scheduling of contract algorithms with soft deadlines ⋮ A general framework for searching on a line ⋮ HEURISTIC SEARCH UNDER CONTRACT ⋮ Weighted online search ⋮ Interruptible algorithms for multiproblem solving ⋮ A General Framework for Searching on a Line
This page was built for publication: Optimal sequencing of contract algorithms
