HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Optimal Sequencing of Contract Algorithms

Shlomo Zilberstein 1 François Charpillet 2 Philippe Chassaing 3, 4
2 MAIA - Autonomous intelligent machine
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
3 OMEGA - Probabilistic numerical methods
CRISAM - Inria Sophia Antipolis - Méditerranée , UHP - Université Henri Poincaré - Nancy 1, Université Nancy 2, CNRS - Centre National de la Recherche Scientifique : UMR7502
Abstract : This paper addresses the problem of building an interruptible real-time system using contract algorithms. Contract algorithms offer a tradeoff between computation time and quality of results, but their run-time must be determined when they are activated.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Thursday, October 19, 2006 - 3:40:32 PM
Last modification on : Friday, February 26, 2021 - 3:28:04 PM


  • HAL Id : inria-00108057, version 1



Shlomo Zilberstein, François Charpillet, Philippe Chassaing. Optimal Sequencing of Contract Algorithms. Bar-Ilan Symposium on the Foundation of Artificial Intelligence, 1999, Ramat Gan, Israel. ⟨inria-00108057⟩



Record views