40 search results - page 2 / 8 » On Conditional Branches in Optimal Decision Trees |
UAI
2003
13 years 6 months ago
2003
For a given problem, the optimal Markov policy over a finite horizon is a conditional plan containing a potentially large number of branches. However, there are applications wher...
ENTCS
2006
13 years 4 months ago
2006
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...
ENTCS
2008
13 years 4 months ago
2008
Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures that are able to st...
AAAI
2006
13 years 6 months ago
2006
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...