1376 search results - page 18 / 276 » Searching Trees: An Essay |
82
Voted
ACG
2009
Springer
15 years 4 months ago
2009
Springer
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
DMTCS
2002
14 years 9 months ago
2002
Abstract. q
96
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
AAAI
1996
14 years 11 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
ICNC
2005
Springer
15 years 3 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 ...