16430 search results - page 405 / 3286 » On Computable Tree Functions |
166
click to vote
IPPS
1994
IEEE
15 years 11 months ago
1994
IEEE
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...
211
click to vote
SPAA
1993
ACM
15 years 11 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
156
click to vote
FOCS
1989
IEEE
15 years 11 months ago
1989
IEEE
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
158
click to vote
AINA
2008
IEEE
15 years 8 months ago
2008
IEEE
A number of IEEE 802.15.4 devices can be connected by a tree topology as proposed by ZigBee specification. Address configuration in tree-based ZigBee networks needs to assign ever...
175
click to vote
CG
2010
Springer
15 years 4 months ago
2010
Springer
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...