Principles and applications of continual computation

DOI10.1016/S0004-3702(00)00082-5MaRDI QIDQ5940823zbMATH OpenOpenAlexWikidataFDO

Authors Eric 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)

Recommendations

• Deliberation scheduling for problem solving in time-constrained environments
• scientific article; zbMATH DE number 2112157
• Principles of metareasoning
• scientific article; zbMATH DE number 41806
• scientific article; zbMATH DE number 2201583

Cites work

• Approximate Algorithms for the 0/1 Knapsack Problem
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Coalitions among computationally bounded agents
• Deliberation scheduling for problem solving in time-constrained environments
• Generalized speculative computation of parallel simulated annealing
• scientific article; zbMATH DE number 4174360 (Why is no real title available?)
• scientific article; zbMATH DE number 4176499 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 797445 (Why is no real title available?)
• scientific article; zbMATH DE number 278828 (Why is no real title available?)
• On the Regularity of a General Method of Summation
• Optimal composition of real-time systems
• The computational complexity of probabilistic inference using Bayesian belief networks

Cited in

(12)

• Deliberation scheduling for problem solving in time-constrained environments
• Computing with continuous change
• Coalitions among computationally bounded agents
• Anytime anyspace probabilistic inference
• Algorithmic rationality: game theory with costly computation
• Computer science and decision theory
• Continuity as a computational effect
• Collective Computation With Continuous Variables
• ASPECTS OF PERSISTENT COMPUTATIONS
• scientific article; zbMATH DE number 1897131 (Why is no real title available?)
• Optimal schedules for monitoring anytime algorithms
• Bargaining with limited computation: Deliberation equilibrium

Describes a project that uses

Uses Software

• MS SQL Server

This page was built for publication: Principles and applications of continual computation

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