Anytime algorithms are designed to be predictable.[3] Another goal is that someone can interrupt the process and the algorithm would give its most accurate result.[3] This is why it is called an interruptible algorithm.
An Anytime Algorithm for Decision Making under Uncertainty. By Michael C. Horsch and David Poole. In Proc. 14th Conference on Uncertainty in Artificial Intelligence (UAI-98), Madison, Wisconsin, USA, July 1998, pages 246-255.
The first involves the use of anytime algorithms (Dean and Boddy, 1988). An anytime algorithm is an algorithm whose output quality improves gradually over time, so that it has a reasonable decision ready whenever it is interrupted.
 See also: Planning, Agent, Artificial intelligence, AI, Knowledge
  
|
RSS
