Optimal Sequencing of Contract Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Annals of Mathematics and Artificial Intelligence Year : 2003

Optimal Sequencing of Contract Algorithms

Shlomo Zilberstein
  • Function : Author
Philippe Chassaing


We address the problem of building an interruptible real-time system using non-interruptible components. Some artificial intelligence techniques offer a tradeoff between computation time and quality of results, but their run-time must be determined when they are activated. These techniques, called contract algorithms, introduce a complex scheduling problem when there is uncertainty about the amount of time available for problem-solving. We show how to optimally sequence contract algorithms to create the best possible interruptible system with or without stochastic information about the deadline. These results extend the foundation of real-time problem-solving and provide useful guidance for embedding contract algorithms in applications.

Dates and versions

inria-00099720 , version 1 (26-09-2006)



Shlomo Zilberstein, François Charpillet, Philippe Chassaing. Optimal Sequencing of Contract Algorithms. Annals of Mathematics and Artificial Intelligence, 2003, 39 (1), pp.1-18. ⟨10.1023/A:1024412831598⟩. ⟨inria-00099720⟩
80 View
0 Download



Gmail Facebook X LinkedIn More