Sciweavers

185 search results - page 17 / 37
» Simulation-Based Optimization Algorithms for Finite-Horizon ...
Sort
View
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick
IJCAI
2003
13 years 9 months ago
Automated Generation of Understandable Contingency Plans
Markov decision processes (MDPs) and contingency planning (CP) are two widely used approaches to planning under uncertainty. MDPs are attractive because the model is extremely gen...
Max Horstmann, Shlomo Zilberstein
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
GECCO
2005
Springer
152views Optimization» more  GECCO 2005»
14 years 1 months ago
GAMM: genetic algorithms with meta-models for vision
Recent adaptive image interpretation systems can reach optimal performance for a given domain via machine learning, without human intervention. The policies are learned over an ex...
Greg Lee, Vadim Bulitko
IJCAI
2003
13 years 9 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...