Algorithms in C
Operational rationality through compilation of anytime algorithms
Operational rationality through compilation of anytime algorithms
Optimal composition of real-time systems
Artificial Intelligence
Anytime Algorithm Development Tools
Anytime Algorithm Development Tools
International Journal of Learning Technology
Maximization of the average quality of anytime contract algorithms over a time interval
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Infinities in quantum field theory and in classical computing: renormalization program
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Renormalisation and computation ii: Time cut-off and the halting problem
Mathematical Structures in Computer Science
Developing a real-time inference approach for rule-based reasoning systems
Proceedings of the 2013 Research in Adaptive and Convergent Systems
| Hi-index | 0.00 |
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.