70 search results - page 12 / 14 » Optimal Route Planning under Uncertainty |
108
click to vote
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 1 months ago
: 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...
116
click to vote
ECAI
1998
Springer
15 years 4 months ago
1998
Springer
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
125
click to vote
ICDE
2005
IEEE
15 years 6 months ago
2005
IEEE
Current federated systems deploy cost-based query optimization mechanisms; i.e., the optimizer selects a global query plan with the lowest cost to execute. Thus, cost functions in...
105
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
95
Voted
FLAIRS
2009
14 years 10 months ago
2009
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...