234 search results - page 8 / 47 » Randomized splay trees: Theoretical and experimental results |
157
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
131
click to vote
CP
1997
Springer
15 years 10 months ago
1997
Springer
In the last few years there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Quite intrigu...
166
click to vote
ICAISC
2010
Springer
15 years 10 months ago
2010
Springer
In the paper a new evolutionary algorithm for induction of univariate regression trees is proposed. In contrast to typical top-down approaches it globally searches for the best tre...
169
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
In the paper we propose a new evolutionary algorithm for induction of univariate regression trees that associate leaves with simple linear regression models. In contrast to typical...
158
click to vote
SOFSEM
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...