Sciweavers

829 search results - page 33 / 166
» Bandit Algorithms for Tree Search
Sort
View
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
14 years 11 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
92
Voted
ML
2010
ACM
159views Machine Learning» more  ML 2010»
14 years 8 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
ALGORITHMS
2010
114views more  ALGORITHMS 2010»
14 years 7 months ago
Graph Extremities Defined by Search Algorithms
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Ge...
JUCS
2008
172views more  JUCS 2008»
14 years 9 months ago
A Hybrid Transgenetic Algorithm for the Prize Collecting Steiner Tree Problem
: Evolutionary algorithms are effective search tools for tackling difficult optimization problems. In this paper an algorithm based on living processes where cooperation is the mai...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...
67
Voted
IROS
2006
IEEE
166views Robotics» more  IROS 2006»
15 years 3 months ago
Anytime RRTs
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
Dave Ferguson, Anthony Stentz