Maximization of the average quality of anytime contract algorithms over a time interval

Authors:
Arnaud Delhay;Max Dauchet;Patrick Taillibert;Philippe Vanheeghe
Affiliations:
LIFL, ISEN, Lille;LIFL, Villeneuve;Thomson-CSF Detexis, Trappes;ISEN, Lille
Venue:
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Year:
1999

Citing 4
Cited 0

Real-time heuristic search

Artificial Intelligence
Optimal composition of real-time systems

Artificial Intelligence
Reasoning about computational resource allocation

Crossroads - Special issue on artificial intelligence
Knowledge-based anytime computation

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Previous studies considered quality optimization of anytime algorithms by taking into account the quality of the final result. The problem we are interested in is the maximization of the average quality of a contract algorithm over a time interval. We first informally illustrate and motivate this problem with few concrete situations. Then we prove that the problem is NPhard, but quadratic if the time interval is large enough. Eventually we give empirical results.