Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:defines |
An algorithm that can return a valid solution even if it is interrupted before it finishes.
|
| gptkbp:field |
gptkb:artificial_intelligence
computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Anytime algorithms
|
| gptkbp:notableExample |
A* search with anytime modifications
Anytime Repairing A* (ARA*) Iterative deepening search |
| gptkbp:notablePublication |
Dean, T. & Boddy, M. (1988). An analysis of time-dependent planning.
Zilberstein, S. (1996). Using anytime algorithms in intelligent systems. |
| gptkbp:property |
quality of solution improves with more computation time
|
| gptkbp:relatedTo |
approximation algorithms
incremental computation heuristic search |
| gptkbp:uses |
real-time systems
resource-bounded reasoning |
| gptkbp:bfsParent |
gptkb:Anytime_Repairing_A*
|
| gptkbp:bfsLayer |
7
|