144 search results - page 12 / 29 » A speculation-friendly binary search tree |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
ACNS
2005
Springer
14 years 1 months ago
2005
Springer
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values speci...
ICANN
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we present a system capable of dynamically learning shapes in a way that also allows for the dynamic deletion of shapes already learned. It uses a self-balancing Bin...
ICDCSW
2003
IEEE
14 years 28 days ago
2003
IEEE
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
SWAT
1992
Springer
13 years 11 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...