Magazine:
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.
Reasoning about computational resource allocation
Full text also available in the ACM Digital Library as PDF | HTML | Digital Edition
Thank you for your interest in this article. This content is protected. You may log in with your ACM account or subscribe to access the full text.