Report on the IJCAI-95 workshop on anytime algorithms and deliberation scheduling

1995 ◽  
Vol 6 (4) ◽  
pp. 25
Author(s):  
Michael Pittarelli
Author(s):  
Justin Svegliato ◽  
Kyle Hollins Wray ◽  
Shlomo Zilberstein

Anytime algorithms enable intelligent systems to trade computation time with solution quality. To exploit this crucial ability in real-time decision-making, the system must decide when to interrupt the anytime algorithm and act on the current solution. Existing meta-level control techniques, however, address this problem by relying on significant offline work that diminishes their practical utility and accuracy. We formally introduce an online performance prediction framework that enables meta-level control to adapt to each instance of a problem without any preprocessing. Using this framework, we then present a meta-level control technique and two stopping conditions. Finally, we show that our approach outperforms existing techniques that require substantial offline work. The result is efficient nonmyopic meta-level control that reduces the overhead and increases the benefits of using anytime algorithms in intelligent systems.


2015 ◽  
Vol 26 (04) ◽  
pp. 465-475 ◽  
Author(s):  
Cristian S. Calude ◽  
Damien Desfontaines

A program which eventually stops but does not halt “too quickly” halts at a time which is algorithmically compressible. This result — originally proved in [4] — is proved in a more general setting. Following Manin [11] we convert the result into an anytime algorithm for the halting problem and we show that the stopping time (cut-off temporal bound) cannot be significantly improved.


2008 ◽  
Vol 11 (3-4) ◽  
pp. 321-336 ◽  
Author(s):  
Xiaopeng Xi ◽  
Ken Ueno ◽  
Eamonn Keogh ◽  
Dah-Jye Lee

Sign in / Sign up

Export Citation Format

Share Document