33 search results - page 1 / 7 » Evaluating Root Parallelization in Go |
TCIAIG
2010
12 years 11 months ago
2010
Abstract--Parallelizing Monte-Carlo tree search has been considered to be a way to improve the strength of computer Go programs. In this paper, we analyze the performance of two ro...
CG
2008
Springer
13 years 6 months ago
2008
Springer
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
BMCBI
2008
13 years 4 months ago
2008
Background: Researchers interested in analysing the expression patterns of functionally related genes usually hope to improve the accuracy of their results beyond the boundaries o...
APCSAC
2000
IEEE
13 years 9 months ago
2000
IEEE
Hardware square-root units require large numbers of gates even for iterative implementations. In this paper, we present four low-cost high-performance fullypipelined n-select impl...
IPPS
2010
IEEE
13 years 2 months ago
2010
IEEE
Unplanned system outages have a negative impact on company revenues and image. While the last decades have seen a lot of efforts from industry and academia to avoid them, they stil...