144 search results - page 12 / 29 » Non-blocking binary search trees |
SIAMCOMP
2002
14 years 9 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
100
click to vote
CEC
2003
IEEE
15 years 1 months ago
2003
IEEE
AbstractGaphyl is an application of evolutionary algorithms (EA's) to phylogenetics, an approach used by biologists to investigate evolutionary relationships among organisms. ...
84
Voted
CORR
2010
Springer
14 years 9 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
15 years 3 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
14 years 8 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...