Anytime algorithm: Difference between revisions

Revision as of 12:11, 11 February 2011

Revision as of 06:55, 25 May 2011

Line 1:

{{Disputed|date=May 2008}}

In [[computer science]] an '''anytime algorithm''' is an [[algorithm]] that can return a valid solution to a [[Problem#Problem_solving|problem]] even if itsit's interrupted at any time before it ends. The algorithm is expected to find better and better solutions the more time it keeps running.

Most algorithms run to completion: they provide a single answer after performing some fixed amount of computation. In some cases, however, the user may wish to terminate the algorithm prior to completion. The amount of the computation required may be substantial, for example, and computational resources might need to be reallocated. Most algorithms either run to completion or they provide no useful solution information. Anytime algorithms, however, are able to return a partial answer, whose quality depends on the amount of computation they were able to perform. The answer generated by anytime algorithms is an approximation of the correct answer.