Optimal schedules for monitoring anytime algorithms

DOI10.1016/S0004-3702(00)00072-2zbMath0969.68023MaRDI QIDQ5940820

Shaul Markovitch, L. Finkelstein

Publication date: 20 August 2001

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

zbMATH Keywords

anytime algorithmsmeta-reasoningmonitoring

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) General topics in artificial intelligence (68T01)

Related Items

A model of anytime algorithm performance for bi-objective optimization

Uses Software

• BRENT

Cites Work

• Deliberation scheduling for problem solving in time-constrained environments
• Rationality and intelligence
• Learnability and the Vapnik-Chervonenkis dimension
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On the Regularity of Moment Methods of Summation
• Monitoring and control of anytime algorithms: A dynamic programming approach
• Principles and applications of continual computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item