메뉴 건너뛰기




Volumn 6515 LNCS, Issue , 2011, Pages 36-47

On the scalability of parallel UCT

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITION TIME; CORE MACHINES; DISTRIBUTED ALGORITHM; DISTRIBUTED PARALLELISM; FOUR-CORE; PARALLEL SPEEDUPS; PARALLELIZATIONS; PERFORMANCE BOUNDS; QUALITY IMPROVEMENT; SHARED MEMORY MACHINES; SINGLE-THREADED; TIME-SCALES; UPPER BOUND; MULTIPLE MACHINE;

EID: 79952022478     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17928-0_4     Document Type: Conference Paper
Times cited : (18)

References (10)
  • 1
    • 55849142990 scopus 로고    scopus 로고
    • The parallelization of monte-carlo planning - Parallelization of mc-planning
    • Gelly, S., Hoock, J.B., Rimmel, A., Teytaud, O., Kalemkarian, Y.: The parallelization of monte-carlo planning - parallelization of mc-planning. In: ICINCO-ICSO, pp. 244-249 (2008)
    • (2008) ICINCO-ICSO , pp. 244-249
    • Gelly, S.1    Hoock, J.B.2    Rimmel, A.3    Teytaud, O.4    Kalemkarian, Y.5
  • 2
    • 33750293964 scopus 로고    scopus 로고
    • Bandit based monte-carlo planning
    • Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. Springer, Heidelberg
    • Kocsis, L., Szepesvári, C.: Bandit based monte-carlo planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282-293. Springer, Heidelberg (2006)
    • (2006) LNCS (LNAI) , vol.4212 , pp. 282-293
    • Kocsis, L.1    Szepesvári, C.2
  • 5
    • 55249093890 scopus 로고    scopus 로고
    • Parallel monte-carlo tree search
    • van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. Springer, Heidelberg
    • Chaslot, G.M.J.-B., Winands, M.H.M., van den Herik, H.J.: Parallel monte-carlo tree search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 60-71. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5131 , pp. 60-71
    • Chaslot, G.M.J.-B.1    Winands, M.H.M.2    Van Den Herik, H.J.3
  • 6
    • 77958490691 scopus 로고    scopus 로고
    • A lock-free multithreaded monte-carlo tree search algorithm
    • Enzenberger, M., Müller, M.: A lock-free multithreaded monte-carlo tree search algorithm. In: Advances in Computer Games 12 (2009)
    • (2009) Advances in Computer Games , vol.12
    • Enzenberger, M.1    Müller, M.2
  • 7
    • 0036568025 scopus 로고    scopus 로고
    • Finite-time analysis of the multiarmed bandit problem
    • Auer, P., Cesa-Binachi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning 47, 235-256 (2002)
    • (2002) Machine Learning , vol.47 , pp. 235-256
    • Auer, P.1    Cesa-Binachi, N.2    Fischer, P.3
  • 9
    • 55249086527 scopus 로고    scopus 로고
    • A parallel monte-carlo tree search algorithm
    • van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. Springer, Heidelberg
    • Cazenave, T., Jouandeau, N.: A parallel monte-carlo tree search algorithm. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 72-80. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5131 , pp. 72-80
    • Cazenave, T.1    Jouandeau, N.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.