Eric A. Hansen, Shlomo Zilberstein  Home/Search
Context Related
| umass.edu/shlomo/papers/aij01a.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umass.edu/shlomo/Publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in solving time-critical problems such as planning and scheduling, belief network evaluation, and information gathering. To exploit this tradeoff, a system must be able to decide when to stop deliberation and act on the currently available solution. This paper analyzes the characteristics of existing techniques for meta-level control of anytime algorithms and develops a new framework for... (Update)
Cited by: More
Adaptive Online Time Allocation to Search Algorithms - Gagliolo, Zhumatiy.. (2004) (Correct)
Dynamic Algorithm Portfolios - And (Correct)
Experiments on Deliberation Equilibria in Auctions - Larson, Sandholm (2004) (Correct)
Similar documents (at the sentence level):
10.6%: Monitoring the Progress of Anytime Problem-Solving - Hansen, Zilberstein (1996) (Correct)
10.6%: Monitoring Anytime Algorithms - Eric Hansen And (1996) (Correct)
Active bibliography (related documents): More All
0.8: Using Performance Profile Trees to Improve Deliberation Control - Larson, Sandholm (2004) (Correct)
0.5: Anytime Sensing, Planning and Action: A Practical Model.. - Shlomo Zilberstein And (1993) (Correct)
0.5: If at First You Don't Succeed... - Toyama, Hager (1997) (Correct)
Similar documents based on text: More All
0.8: Using Anytime Algorithms in Intelligent Systems - Zilberstein (1996) (Correct)
0.6: An Anytime Computation Approach to Information Gathering - Zilberstein (1995) (Correct)
0.6: Knowledge-Based Anytime Computation - Mouaddib, Zilberstein (1995) (Correct)
Related documents from co-citation: More All
14: Deliberation scheduling for problem solving in time-constrained environments (context) - Boddy, Dean - 1994
10: Optimal composition of real-time systems - Zilberstein, Russell - 1996
8: Reasoning about beliefs and actions under computational resource constraints - Horvitz - 1987
BibTeX entry: (Update)
Eric Hansen and Shlomo Zilberstein. Monitoring and control of anytime algorithms: A dynamic programming approach. Articial Intelligence, 126:139-157, 2001. http://citeseer.ist.psu.edu/hansen01monitoring.html More
@article{ hansen01monitoring,
author = "Eric A. Hansen and Shlomo Zilberstein",
title = "Monitoring and control of anytime algorithms: A dynamic programming approach",
journal = "Artificial Intelligence",
volume = "126",
number = "1-2",
pages = "139-157",
year = "2001",
url = "citeseer.ist.psu.edu/hansen01monitoring.html" }
Citations (may not include all citations):402 An analysis of time-dependent planning (context) - Dean, Boddy - 1988
242 Planning and Control (context) - Dean, Wellman - 1991
230 Dynamic Programming: Deterministic and Stochastic Models (context) - Bertsekas - 1987
141 An effective heuristic algorithm for the Traveling Salesman .. (context) - Lin, Kernighan - 1973
137 Do the Right Thing: Studies in Limited Rationality (context) - Russell, Wefald - 1991
93 Reasoning about beliefs and actions under computational reso.. - Horvitz - 1987
89 Deliberation scheduling for problem solving in time-constrai.. (context) - Boddy, Dean - 1994
85 Reasoning under varying and uncertain resource constraints - Horvitz - 1988
84 The Traveling Salesman: Computational Solutions for TSP Appl.. (context) - Reinelt - 1994
82 Optimal composition of real-time systems - Zilberstein, Russell - 1996
81 Operational rationality through compilation of anytime algor.. - Zilberstein - 1993
77 Provably bounded-optimal agents - Russell, Subramanian - 1995
60 Reflection and action under scarce resources: Theoretical pr.. - Horvitz, Cooper et al. - 1989
60 Models of Bounded Rationality (context) - Simon - 1982
57 Approximate processing in real-time problem solving (context) - Lesser, Pavlin et al. - 1988
54 Bounded conditioning: Flexible inference for decisions under.. (context) - Horvitz, Suermondt et al. - 1989
42 Computation and action under bounded resources (context) - Horvitz - 1990
30 Twenty-seven principles of rationality (context) - Good - 1971
30 Artificial Intelligence (context) - Russell, Wefald et al. - 1991
28 State-space abstraction for anytime evaluation of probabilis.. - Wellman, Liu - 1994
25 Time-dependent utility and action under uncertainty - Horvitz, Rutledge - 1991
22 Monotonically improving approximate answers to relational al.. (context) - Smith, Liu - 1989
21 Ideal reformulation of belief networks (context) - Breese, Horvitz - 1990
19 Reducing problem-solving variance to improve predictability (context) - Paul, Acharya et al. - 1991
16 On optimal game-tree search using rational metareasoning (context) - Russell, Wefald - 1989
14 Real-time problem-solving with contract algorithms - Zilberstein, Charpillet et al. - 1999
11 Minimizing response times in real time planning and search (context) - Shekhar, Dutta - 1989
11 Resource-bounded sensing and planning in autonomous systems - Zilberstein - 1996
10 Optimal scheduling of dynamic progressive processing - Mouaddib, Zilberstein - 1998
8 Optimizing decision trees through heuristically guided searc.. (context) - Martelli, Montanari - 1978
8 Reactive control of dynamic progressive processing - Zilberstein, Mouaddib - 1999
7 Computationally-optimal real-resource strategies (context) - Einav, Fehling - 1990
6 A value-driven system for autonomous information gathering (context) - Grass, Zilberstein - 2000
4 IEEE Transactions on Systems Science (context) - Matheson, of et al. - 1968
3 Highest utility first search across multiple levels of stoch.. - Steinberg, Hall et al. - 1998
2 Estimating the value of computation in flexible information .. - Horsch, Poole - 1999
2 Handling tradeoffs between precision and robustness with inc.. - Toyama - 1996
2 Integration planning and reacting in a heterogeneous asynchr.. (context) - Gat - 1992
2 Quality-time tradeoffs in simulated annealing for VLSI place.. (context) - Raman, Wah - 1991
2 Optimizing resource utilization in planetary rovers - Zilberstein, Mouaddib - 2000
1 Optimum anytime bounding for constraint optimization problem.. (context) - de Givry, Verfaillie - 1997
1 Extended abstract: Learning search strategies (context) - Harada, Russell - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://anytime.cs.umass.edu/shlomo/Publications.html): More
Intelligent Information Gathering Using Decision Models - Zilberstein, Lesser (1996) (Correct)
The Complexity of Decentralized Control of Markov.. - Bernstein.. (2000) (Correct)
Adaptive Peer Selection - Bernstein, Feng, Levine, Zilberstein (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC