David C. Parkes Computer and Information Science University of Pennsylvania...  Home/Search
Context
Related
| users.cs.york.ac.uk/~tw...greenwald.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: users.cs.york.ac.uk/~tw/fall/P... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a flexible procedure for a resourcebounded agent to allocate limited computational resources to on-line problem solving. Our AP- PROXIMATE AND COMPENSATE methodology extends a well-known greedy time-slicing approach to conditions in which performance profiles may be non-concave and there is uncertainty in the environment and/or problem-solving procedures of an agent. With this method, the agent first approximates problem-solving performance and problem parameters with... (Update)
Similar documents (at the sentence level):
72.4%: Approximate and Compensate: A method for risk-sensitive.. - Computer (Correct)
Active bibliography (related documents): More All
0.2: On Retaining Intermediate Probabilistic Models When.. - Doshi, Greenwald, Clarke (2001) (Correct)
0.1: Anytime Deliberation For Computer Game Agents - Hawes (2003) (Correct)
0.1: A Bayesian System for Integration of Algorithms for Real-Time.. - Guo (2002) (Correct)
Similar documents based on text: More All
0.4: Optimal Auction Design for Agents with Hard Valuation Problems - Parkes (1999) (Correct)
0.4: Multiagent Cooperative Search for Portfolio Selection - Parkes, Huberman (Correct)
0.3: Cooperative Multiagent Search for Portfolio Selection - Parkes, Huberman (Correct)
BibTeX entry: (Update)
@misc{ computer-approximate,
author = "David Parkes Computer",
title = "Approximate and Compensate: A method for risk-sensitive meta-deliberation
and continual computation",
url = "citeseer.ist.psu.edu/717099.html" }
Citations (may not include all citations):261 Reactive reasoning and planning (context) - Michael, Lansky - 1987
242 Planning and Control (context) - Thomas, Michael - 1991
127 Portfolio Selection (context) - Harry - 1959
83 Designto -time real-time scheduling - Garvey, Lesser - 1993
82 Optimal composition of real-time systems - Shlomo, Stuart - 1996
81 Operational Rationality through Compilation of Anytime Algor.. - Shlomo - 1993
58 Using anytime algorithms in intelligent systems - Shlomo - 1996
54 Bounded conditioning: Flexible inference for decisions under.. (context) - Eric, Suermondt et al. - 1989
33 Embedding decision-analytic control in a learning architectu.. (context) - Oren - 1991
18 Solving time-critical decision-making problems with predicta.. - Lloyd, Thomas - 1994
16 Principles and applications of continual computation - Eric - 2001
16 Ideal partition of resources for metareasoning (context) - Eric, Breese - 1990
15 Decision-theoretic deliberation scheduling for problem solvi.. - Mark, Thomas - 1994
9 Computational tradeoffs under bounded resources (context) - Eric, Shlomo - 2001
8 Anytime sensing (context) - Shlomo, Stuart - 1993
4 Time to laparotomy for intra-abdominal bleeding from trauma .. (context) - John, Trooskin et al. - 2001
3 Algorithm portfolios (context) - Carla, Selman - 2001
3 the optimality of greedy meta-deliberation (context) - David, Greenwald et al. - 1999
Documents on the same site (http://www-users.cs.york.ac.uk/~tw/fall/Proceedings/): More
Scheduling Contract Algorithms on Multiple Processors - Bernstein, Zilberstein.. (2002) (Correct)
Selecting the Right Algorithm - Lagoudakis, Littman (Correct)
Incrementally Learning Parameters of Stochastic.. - Brent Heeringa And (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