Abstract
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. To exploit this tradeoff, a system must be able to determine the best time to stop deliberation and act on the currently available solution. If there is uncertainty about how much solution quality will improve with computation time, or about how the problem state may change after the start of the algorithm, monitoring the algorithm's progress and/or the problem state can make possible a better stopping decision and so improve the utility of the system. This paper analyzes the issues involved in run-time monitoring of anytime algorithms. It reviews previous work and casts the problem in a new framework from which some improved monitoring strategies emerge.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
