Crossroads The ACM Magazine for Students

Sign In

Association for Computing Machinery

Magazine: September 1996 | Volume 3, No. 1

Reasoning about computational resource allocation

Anytime Algorithms are algorithms that exchange execution time for quality of results. Since many computational tasks are too complicated to be completed at real-time speeds, anytime algorithms allow systems to intelligently allocate computational time resources in the most effective way, depending on the current environment and the system's goals. This article briefly covers the motivations for creating anytime algorithms, the history of their development, a definition of anytime algorithms, and current research involving anytime algorithms.

By Joshua Grass

HTML | In the Digital Library
Tags: Algorithms, Artificial intelligence, Design, Mathematical software, Measurement, Performance, Philosophical/theoretical foundations of artificial intelligence, Theory