Optimal Sequencing of Contract Algorithms

Authors:
Shlomo Zilberstein;François Charpillet;Philippe Chassaing
Affiliations:
Department of Computer Science, University of Massachusetts, Amherst, MA 01003, USA E-mail: Shlomo@cs.umass.edu;LORIA-INRIA, B.P. 239, 54506 Vandoeuvre-lès-Nancy Cedex, France E-mail: Francois.Charpillet@loria.fr;Institut de Mathématiques Elie Cartan, Université Henri Poincaré Nancy I, B.P. 239, 54506 Vandoeuvre-lès-Nancy Cedex, France E-mail: Philippe.Chassaing@iecn.u-nancy.fr< ...
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2003

Citing 11
Cited 3

Principles of metareasoning

Artificial Intelligence - Special issue on knowledge representation
Computation and action under bounded resources

Computation and action under bounded resources
Searching in the plane

Information and Computation
Deliberation scheduling for problem solving in time-constrained environments

Artificial Intelligence
Optimal composition of real-time systems

Artificial Intelligence
Monitoring and control of anytime algorithms: a dynamic programming approach

Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Reactive Control of Dynamic Progressive Processing

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Real Time Scheduling with Neurosched

ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
Optimizing decision quality with contract algorithms

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Monitoring the progress of anytime problem-solving

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Models of continual computation

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Optimal scheduling of contract algorithms with soft deadlines

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Interruptible algorithms for multi-problem solving

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.