no code implementations • 2 Apr 2017 • S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik, Jos Vermaseren
In this paper, we present a new algorithm for parallel Monte Carlo tree search (MCTS).
no code implementations • 28 Sep 2015 • S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik
Small search trees occur in variations of MCTS, such as parallel and ensemble approaches.
no code implementations • 18 Sep 2014 • Ben Ruijl, Aske Plaat, Jos Vermaseren, Jaap van den Herik
For High Energy Physics this means that numerical integrations that took weeks can now be done in hours.
no code implementations • 25 May 2014 • Ben Ruijl, Jos Vermaseren, Aske Plaat, Jaap van den Herik
We observe that a variable $C_p$ solves our domain: it yields more exploration at the bottom and as a result the tuning problem has been simplified.
no code implementations • 3 Dec 2013 • Ben Ruijl, Jos Vermaseren, Aske Plaat, Jaap van den Herik
Yet, this approach is fit for further improvements since it is sensitive to the so-called exploration-exploitation constant $C_p$ and the number of tree updates $N$.