1138 search results - page 63 / 228 » Feature Markov Decision Processes |
122
click to vote
ALT
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
81
Voted
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
100
Voted
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
How should a reinforcement learning agent act if its sole purpose is to efficiently learn an optimal policy for later use? In other words, how should it explore, to be able to exp...
92
Voted
ICRA
2007
IEEE
15 years 7 months ago
2007
IEEE
— While the Partially Observable Markov Decision Process (POMDP) provides a formal framework for the problem of robot control under uncertainty, it typically assumes a known and ...
103
Voted
AAAI
2007
15 years 3 months ago
2007
A Situated Conversational Agent (SCA) is an agent that engages in dialog about the context within which it is embedded. Situated dialog is characterized by its deep connection to ...