829 search results - page 24 / 166 » Bandit Algorithms for Tree Search |
AAECC
2009
Springer
14 years 5 months ago
2009
Springer
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in terms of the so called central distribution. This new searc...
ATAL
2009
Springer
14 years 5 months ago
2009
Springer
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
ICNC
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
SODA
1990
ACM
14 years 7 hour ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
CP
2003
Springer
14 years 4 months ago
2003
Springer
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...