3055 search results - page 4 / 611 » Randomized Search Trees |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
AAAI
2006
13 years 9 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...
GPEM
2000
13 years 7 months ago
2000
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...