5 citations · 11 across the 4 of their papers we have counts for
4 papers · 1 filter
Structured Parallel Programming for Monte Carlo Tree Search
S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik +1
In this paper, we present a new algorithm for parallel Monte Carlo tree search (MCTS). It is based on the pipeline pattern and allows flexible management of the control flow of the…
Ensemble UCT Needs High Exploitation
S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik
Recent results have shown that the MCTS algorithm (a new, adaptive, randomized optimization algorithm) is effective in a remarkably diverse set of applications in Artificial Intell…
Why Local Search Excels in Expression Simplification
Ben Ruijl, Aske Plaat, Jos Vermaseren +1
Simplifying expressions is important to make numerical integration of large expressions from High Energy Physics tractable. To this end, Horner's method can be used. Finding suitab…
Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification
Ben Ruijl, Jos Vermaseren, Aske Plaat +1
In many applications of computer algebra large expressions must be simplified to make repeated numerical evaluations tractable. Previous works presented heuristically guided improv…