Evaluating Root Parallelization in Go

12 years 11 months ago

Download www.is.titech.ac.jp

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 root parallelization methods

Yusuke Soejima, Akihiro Kishimoto, Osamu Watanabe

Real-time Traffic

Average Selection | Majority Voting | Root Parallelization Methods | Software Engineering | TCIAIG 2010 |

claim paper

Related Content

» Parallel MonteCarlo Tree Search

» Evaluation of GObased functional similarity measures using S cerevisiae protein interactio...

» CostPerformance Tradeoff of nSelect Square Root Implementations

» J2EE instrumentation for software aging root cause application component determination wit...

» dFault Fault Localization in LargeScale PeertoPeer Systems

» Implementing and Evaluating Automatic Checkpointing

» Runtime thread sorting to expose datalevel parallelism

» A case for exploiting subarraylevel parallelism SALP in DRAM

» Harvesting MultiWord Expressions from Parallel Corpora

Post Info
More Details (n/a)

Added	21 May 2011
Updated	21 May 2011
Type	Journal
Year	2010
Where	TCIAIG
Authors	Yusuke Soejima, Akihiro Kishimoto, Osamu Watanabe

Comments (0)

Sciweavers

Evaluating Root Parallelization in Go

Average Selection | Majority Voting | Root Parallelization Methods | Software Engineering | TCIAIG 2010 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers