1277 search results - page 201 / 256 » Terminating Decision Algorithms Optimally |
146
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
140
Voted
AAAI
2006
15 years 5 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...
123
Voted
NIPS
2004
15 years 5 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
155
Voted
IMCSIT
2010
14 years 10 months ago
2010
The paper presents a concept, implementation and real examples of dynamic parallelization of computations using services derived from MPI applications deployed in the BeesyCluster ...
139
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Random Forests (RFs) have become commonplace
in many computer vision applications. Their
popularity is mainly driven by their high computational
efficiency during both training ...