1996/09/01 by Joshua Grass · 1 citation
Computer Science · #AI-based Problem Solving and Planning #Robotic Path Planning Algorithms #Data Management and Algorithms #Computer science #Resource allocation #Resource (disambiguation) #Distributed computing #Quality (philosophy) #Computational resource #Computational complexity theory #Algorithm #Computer network
paper · pdf · doi:10.1145/332148.332154
openalex publication_date 1996/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
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.