3055 search results - page 19 / 611 » Randomized Search Trees |
AINA
2008
IEEE
14 years 2 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...
WIA
2009
Springer
14 years 2 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...
ATAL
2009
Springer
13 years 8 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...
STACS
1999
Springer
13 years 12 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 ...
RSA
2006
13 years 7 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...