Sciweavers

3055 search results - page 34 / 611
» Randomized Search Trees
Sort
View
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 10 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
COCOON
1997
Springer
14 years 1 months ago
Edge and Node Searching Problems on Trees
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming...
IJAR
2010
189views more  IJAR 2010»
13 years 7 months ago
A fuzzy random forest
Following Breiman’s methodology, we propose a multi-classifier based on a “forest” of randomly generated fuzzy decision trees, i.e., a Fuzzy Random Forest. This approach co...
Piero P. Bonissone, José Manuel Cadenas, M....
IJKESDP
2010
149views more  IJKESDP 2010»
13 years 7 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
ICRA
2007
IEEE
125views Robotics» more  ICRA 2007»
14 years 3 months ago
Single-Query Motion Planning with Utility-Guided Random Trees
— 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...
Brendan Burns, Oliver Brock