310 search results - page 24 / 62 » Randomized Binary Search Trees |
120
click to vote
AI
2002
Springer
15 years 1 months ago
2002
Springer
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
123
click to vote
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
126
click to vote
AAAI
1996
15 years 2 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
103
click to vote
DAGM
2005
Springer
15 years 7 months ago
2005
Springer
The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing devi...
123
click to vote
DAC
2003
ACM
16 years 2 months ago
2003
ACM
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...