Anytime algorithm Computer Science Fundamentals
noun phrase
Definition: An algorithm that can return a valid partial (approximate) answer even if interrupted before completion, with solution quality improving as more computation time is available [Bakanach 2023/2024].
Example in context: “Namely, in an anytime algorithm, the quality of output improves gradually as the computation time increases.” [Angelopoulos, Kamali 2023]
Related terms: interruptible algorithm; approximation algorithm; real-time search