Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval - LAGIS-SI Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

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

Résumé

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.
Fichier principal
Vignette du fichier
032.pdf (184.4 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04650290 , version 1 (16-07-2024)

Identifiants

  • HAL Id : hal-04650290 , version 1

Citer

Arnaud Delhay, Max Dauchet, Patrick Taillibert, Philippe Vanheeghe. Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval. International Joint Conference on Artificial Intelligence (IJCAI'99), Jul 1999, Stockholm, Sweden. pp.212-217. ⟨hal-04650290⟩
0 Consultations
0 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More