829 search results - page 20 / 166 » Bandit Algorithms for Tree Search |
ISAAC
2005
Springer
14 years 28 days ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
CEC
2003
IEEE
13 years 11 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. ...
KDD
2000
ACM
13 years 11 months ago
2000
ACM
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
PPOPP
2012
ACM
12 years 3 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
GECCO
2005
Springer
14 years 26 days ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...