121 search results - page 7 / 25 » Algorithms for optimal dyadic decision trees |
AAAI
2004
15 years 1 months ago
2004
Performance profile trees have recently been proposed as a theoretical basis for fully normative deliberation control. In this paper we conduct the first experimental study of the...
134
click to vote
AIPS
2011
14 years 3 months ago
2011
In this paper, we present a new algorithm that integrates recent advances in solving continuous bandit problems with sample-based rollout methods for planning in Markov Decision P...
ICMCS
2006
IEEE
15 years 5 months ago
2006
IEEE
1 In this paper, we introduce and evaluate a low complexity macroblock partition mode decision algorithm for interframe prediction in MPEG-2 to H.264 transcoder. The proposed tools...
101
click to vote
KDD
2009
ACM
16 years 5 days ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
110
click to vote
ICML
2006
IEEE
16 years 13 days ago
2006
IEEE
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...