1277 search results - page 139 / 256 » Terminating Decision Algorithms Optimally |
96
Voted
ECML
2007
Springer
15 years 9 months ago
2007
Springer
In this article, we present an idea for solving deterministic partially observable markov decision processes (POMDPs) based on a history space containing sequences of past observat...
129
Voted
GECCO
2004
Springer
15 years 9 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 ...
149
Voted
PR
2006
15 years 3 months ago
2006
This paper describes an algorithm for the determination of zone content type of a given zone within a document image. We take a statistical based approach and represent each zone ...
126
click to vote
AAAI
2006
15 years 5 months ago
2006
We define TTD-MDPs, a novel class of Markov decision processes where the traditional goal of an agent is changed from finding an optimal trajectory through a state space to realiz...
117
click to vote
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
We propose a method for measuring the quality of a grouping result, based on the following observation: a better grouping result provides more information about the true, unknown g...