Monitoring and control of anytime algorithms: A dynamic programming approach

DOI10.1016/S0004-3702(00)00068-0zbMath0969.68138WikidataQ126471510 ScholiaQ126471510MaRDI QIDQ5940822

No author found.

Publication date: 20 August 2001

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

anytime algorithmsflexible computationmonitoringmeta-level controlreal-time deliberationresource-bounded reasoning

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Learning dynamic algorithm portfolios ⋮ Optimal feedback scheduling of model predictive controllers ⋮ HEURISTIC SEARCH UNDER CONTRACT ⋮ Combining VNS with constraint programming for solving anytime optimization problems ⋮ Optimal schedules for monitoring anytime algorithms ⋮ A model of anytime algorithm performance for bi-objective optimization ⋮ Bargaining with limited computation: Deliberation equilibrium

Uses Software

• TSPLIB

Cites Work

• Principles of metareasoning
• Deliberation scheduling for problem solving in time-constrained environments
• The traveling salesman. Computational solutions for RSP applications
• Optimal composition of real-time systems
• Optimizing decision trees through heuristically guided search
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• On the Regularity of Moment Methods of Summation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item