Sciweavers

682 search results - page 26 / 137
» One-Counter Markov Decision Processes
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
CORR
2008
Springer
85views Education» more  CORR 2008»
15 years 6 months ago
Feature Markov Decision Processes
Marcus Hutter
ORL
2008
68views more  ORL 2008»
15 years 5 months ago
On polynomial cases of the unichain classification problem for Markov Decision Processes
The unichain classification problem detects whether a finite state and action MDP is unichain under all deterministic policies. This problem is NP-hard [11]. This paper provides p...
Eugene A. Feinberg, Fenghsu Yang