Sciweavers

121 search results - page 7 / 25
» Algorithms for optimal dyadic decision trees
Sort
View
AAAI
2004
13 years 9 months ago
Using Performance Profile Trees to Improve Deliberation Control
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...
Kate Larson, Tuomas Sandholm
AIPS
2011
12 years 11 months ago
Sample-Based Planning for Continuous Action Markov Decision Processes
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...
Christopher R. Mansley, Ari Weinstein, Michael L. ...
ICMCS
2006
IEEE
157views Multimedia» more  ICMCS 2006»
14 years 2 months ago
RD-Optimization for MPEG-2 to H.264 Transcoding
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...
Gerardo Fernández-Escribano, Hari Kalva, Pe...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 8 months ago
The offset tree for learning with partial labels
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...
Alina Beygelzimer, John Langford
ICML
2006
IEEE
14 years 8 months ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...