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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|