Sciweavers

502 search results - page 38 / 101
» Monotone Approximation of Decision Problems
Sort
View
IS
2008
14 years 9 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
ATAL
2003
Springer
15 years 2 months ago
Transition-independent decentralized markov decision processes
There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of m...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
AAAI
1996
14 years 11 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
CDC
2010
IEEE
14 years 4 months ago
Preference elicitation in Fully Probabilistic Design of decision strategies
Any systematic decision-making design selects a decision strategy that makes the resulting closed-loop behaviour close to the desired one. Fully Probabilistic Design (FPD) describe...
Miroslav Kárný, Tatiana V. Guy
ML
2002
ACM
143views Machine Learning» more  ML 2002»
14 years 9 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng