90 search results - page 5 / 18 » On the hardness of finding symmetries in Markov decision pro... |
182
Voted
ALDT
2009
Springer
16 years 20 days ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
156
Voted
ICIP
2008
IEEE
16 years 15 days ago
2008
IEEE
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
157
Voted
QEST
2007
IEEE
16 years 10 days ago
2007
IEEE
We give an overview of GRIP, a symmetry reduction tool for the probabilistic model checker PRISM, together with experimental results for a selection of example specifications. 1 ...
178
click to vote
DATE
2008
IEEE
16 years 16 days ago
2008
IEEE
- The effectiveness of stochastic power management relies on the accurate system and workload model and effective policy optimization. Workload modeling is a machine learning proce...
190
click to vote
DATAMINE
2010
15 years 6 months ago
2010
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...