3055 search results - page 116 / 611 » Randomized Search Trees |
COR
2006
13 years 10 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
ALGOSENSORS
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
COLOGNETWENTE
2009
13 years 11 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
MCS
2004
Springer
14 years 3 months ago
2004
Springer
We experimentally evaluate bagging and six other randomization-based approaches to creating an ensemble of decision-tree classifiers. Bagging uses randomization to create multipl...