anytime algorithm

Computing Dictionary

anytime algorithm definition

An algorithm that returns a sequence of approximations to the correct answer such that each approximation is no worse than the previous one, i.e. the algorithm can be stopped at _any time_.
Newton-Raphson iteration applied to finding the square root of a number b is another example:
x = (x + b / x) / 2
Each new x is closer to the square root than the previous one.
Applications might include a real-time control system or a chess program that is allowed a fixed thinking time.

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: anytime
Next Definition: anytime minute
Words Near: anytime algorithm
More from
Synonyms and Antonyms for anytime algorithm
More from
Search for articles containing anytime algorithm Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature