Principles and applications of continual computation

DOI10.1016/S0004-3702(00)00082-5zbMath0969.68139OpenAlexW2050880818WikidataQ64410622 ScholiaQ64410622MaRDI QIDQ5940823

E. Horvitz

Publication date: 20 August 2001

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00082-5

zbMATH Keywords

bounded rationalitycompilationdecision-theoretic controldeliberationmetareasoningspeculative executionvalue of computation

Mathematics Subject Classification ID

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

Related Items

Coalitions among computationally bounded agents, Algorithmic rationality: game theory with costly computation, Optimal schedules for monitoring anytime algorithms, Anytime anyspace probabilistic inference, Computer science and decision theory, Bargaining with limited computation: Deliberation equilibrium

Uses Software

• MS SQL Server

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Deliberation scheduling for problem solving in time-constrained environments
• Coalitions among computationally bounded agents
• Generalized speculative computation of parallel simulated annealing
• The computational complexity of probabilistic inference using Bayesian belief networks
• Optimal composition of real-time systems
• Approximate Algorithms for the 0/1 Knapsack Problem
• On the Regularity of a General Method of Summation