822 search results - page 35 / 165 » Descendants in Increasing Trees |
ACG
2009
Springer
14 years 2 months ago
2009
Springer
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
ISMVL
1997
IEEE
13 years 12 months ago
1997
IEEE
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realiza...
ICML
1990
IEEE
13 years 11 months ago
1990
IEEE
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...
CSDA
2007
13 years 7 months ago
2007
The problem of building a regression tree is considered when the response variable is a probability density function. Splitting criteria which are well adapted to measure the diss...