ML Anthology

Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval

Arnaud Delhay, Max Dauchet, Patrick Taillibert, Philippe Vanheeghe
IJCAI 1999 pp. 212-221
/ijcai/1999/delhay1999ijcai-maximization/

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.

PDF Semantic Scholar

Cite

Text

Delhay et al. "Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval." International Joint Conference on Artificial Intelligence, 1999.

Markdown

[Delhay et al. "Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/delhay1999ijcai-maximization/)

BibTeX

@inproceedings{delhay1999ijcai-maximization,
  title     = {{Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval}},
  author    = {Delhay, Arnaud and Dauchet, Max and Taillibert, Patrick and Vanheeghe, Philippe},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1999},
  pages     = {212-221},
  url       = {https://mlanthology.org/ijcai/1999/delhay1999ijcai-maximization/}
}