scientific article; zbMATH DE number 67465

MaRDI QIDQ4012193zbMATH OpenFDO

Authors Stuart J. Russel, Shlomo Zilberstein

Publication date 27 September 1992

zbMATH Keywords

anytime algorithmscomplex real-time systemsplanning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• Optimal composition of real-time systems
• Monitoring and control of anytime algorithms: A dynamic programming approach
• Anytime Control Algorithms for Embedded Real-Time Systems
• scientific article; zbMATH DE number 1222101
• scientific article; zbMATH DE number 53319

Cited in

(18)

• Deliberation scheduling for problem solving in time-constrained environments
• Rationality and intelligence
• Abstraction and approximate decision-theoretic planning.
• Criteria-directed task scheduling
• Tractable reasoning via approximation
• BIG: An agent for resource-bounded information gathering and decision making
• Further connections between contract-scheduling and ray-searching problems
• Interruptible algorithms for multiproblem solving
• Multi-processor search and scheduling problems with setup cost
• Optimal scheduling of contract algorithms with soft deadlines
• Optimal composition of real-time systems
• scientific article; zbMATH DE number 3862435 (Why is no real title available?)
• Optimal schedules for monitoring anytime algorithms
• From binary temporal relations to non-binary ones and back
• Minimax real-time heuristic search
• Weighted online search
• Contract scheduling with predictions
• Online computation with untrusted advice

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012193)