92 search results - page 9 / 19 » Game-based Abstraction for Markov Decision Processes |
ICML
1998
IEEE
14 years 10 months ago
1998
IEEE
tion Learning about Temporally Abstract Actions Richard S. Sutton Department of Computer Science University of Massachusetts Amherst, MA 01003-4610 rich@cs.umass.edu Doina Precup D...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
ICMLA
2009
13 years 7 months ago
2009
Abstract--Feature selection is an important challenge in machine learning. Unfortunately, most methods for automating feature selection are designed for supervised learning tasks a...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Factored Markov Decision Processes is the theoretical framework underlying multi-step Learning Classifier Systems research. This framework is mostly used in the context ...
ECSQARU
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...