104 search results - page 6 / 21 » Incomplete Tree Search using Adaptive Probing |
138
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
Automatic tuning has emerged as a solution to provide high-performance libraries for fast changing, increasingly complex computer architectures. We distinguish offline adaptation (...
119
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
111
click to vote
SODA
2003
ACM
15 years 2 months ago
2003
ACM
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
130
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
111
click to vote
AI
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Adaptive Benford's Law [1] is a digital analysis technique that specifies the probabilistic distribution of digits for many commonly occurring phenomena, even for in...