Name
Title | ||
|---|---|---|
Maximization of the Average Quality of Anytime Contract Algorithms over a Time Interval |
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. |
Year | Venue | Keywords |
|---|---|---|
1999 | IJCAI | empirical result,average quality,previous study,time interval,quality optimization,final result,anytime contract algorithms,contract algorithm,large enough,concrete situation |
Field | DocType | ISBN |
Mathematical optimization,Computer science,Quality optimization,Quadratic equation,Algorithm,Artificial intelligence,Maximization,Machine learning | Conference | 1-55860-613-0 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arnaud Delhay | 1 | 57 | 7.81 |
| Max Dauchet | 2 | 655 | 67.02 |
| Patrick Taillibert | 3 | 77 | 15.76 |
| Philippe Vanheeghe | 4 | 250 | 22.87 |