515 search results - page 39 / 103 » Approximating Markov Processes by Averaging |
99
Voted
QRE
2010
2010
Improving quality of prediction in highly dynamic environments using approximate dynamic programming
14 years 10 months ago
In many applications, decision making under uncertainty often involves two steps- prediction of a certain quality parameter or indicator of the system under study and the subseque...
113
click to vote
AAAI
2006
15 years 1 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
107
click to vote
ATAL
2010
Springer
14 years 6 months ago
2010
Springer
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
NIPS
2007
15 years 1 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
PODS
2005
ACM
15 years 12 months ago
2005
ACM
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...