Author:
Graf Tobias,Lorenz Ulf,Platzner Marco,Schaefers Lars
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-Time Analysis of the Multiarmed Bandit Problem. In: Machine Learning, vol. 47, pp. 235–256. Kluwer Academic, Dordrecht (2002)
2. Bourki, A., Chaslot, G.M.J.-B., Coulm, M., Danjean, V., Doghmen, H., Hoock, J.-B., Hérault, T., Rimmel, A., Teytaud, F., Teytaud, O., Vayssiére, P., Yu, Z.: Scalability and Parallelization of Monte-Carlo Tree Search. In: International Conference on Computers and Games, pp. 48–58 (2010)
3. Chaslot, G.M.J.-B., Winands, M.H.M., Jaap van den Herik, H.: Parallel Monte-Carlo Tree Search. In: Conference on Computers and Games, pp. 60–71 (2008)
4. Lecture Notes in Computer Science;R. Coulom,2007
5. Coulom, R.: Computing Elo Ratings of Move Patterns in the Game of Go. ICGA Journal 30(4), 198–208 (2007)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献