3055 search results - page 19 / 611 » Randomized Search Trees |
109
click to vote
AINA
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
125
click to vote
WIA
2009
Springer
15 years 9 months ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
116
click to vote
ATAL
2009
Springer
15 years 3 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
124
click to vote
STACS
1999
Springer
15 years 6 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
130
click to vote
RSA
2006
15 years 2 months ago
2006
We study the asymptotic behaviour of the number Nk,n of nodes of given degree k in unlabeled random trees, when the tree size n and the node degree k both tend to infinity. It is s...