532 search results - page 7 / 107 » Tree exploration with advice |
97
Voted
ACG
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present a new exploration term, more efficient than classical UCT-like exploration terms. It combines efficiently expert rules, patterns extracted from datasets, All-M...
111
Voted
ACMSE
2007
ACM
15 years 3 months ago
2007
ACM
Although skip lists were introduced as an alternative to balanced binary search trees (BSTs), we show that the skip list can be interpreted as a type of randomly-balanced BST whos...
TYPES
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
124
Voted
ICS
2009
Tsinghua U.
15 years 4 months ago
2009
Tsinghua U.
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
68
Voted
CISIS
2008
IEEE
15 years 6 months ago
2008
IEEE
