메뉴 건너뛰기




Volumn 2, Issue , 2009, Pages 125-128

Backpropagation Modification in Monte-Carlo Game Tree Search

Author keywords

Machine learning; Monte carlo tree search; Weight factor

Indexed keywords

EXPONENTIAL MODELS; GAME TREE SEARCH; MACHINE-LEARNING; MONTE CARLO; MONTE CARLO SIMULATION; MULTI-ARMED BANDIT PROBLEM; SEARCH SPACES; TREE SEARCH; WEIGHT FACTOR;

EID: 77649307992     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IITA.2009.331     Document Type: Conference Paper
Times cited : (15)

References (11)
  • 1
    • 84880649215 scopus 로고    scopus 로고
    • A sparse sampling algorithm for near optimal planning in large Markovian decision processes
    • M. Kearns, Y. Mansour, and A.Y. Ng: A sparse sampling algorithm for near optimal planning in large Markovian decision processes. In Proceedings of IJCAI'99, pages 1324-1331, 1999.
    • (1999) Proceedings of IJCAI'99 , pp. 1324-1331
    • Kearns, M.1    Mansour, Y.2    Ng, A.Y.3
  • 2
    • 77649304247 scopus 로고    scopus 로고
    • Gelly,S.,Wang,Y.: Exploration exploitation in go: UCT for Monte-Carlo go. In:NIPS-2006:On-line trading of Exploration and Exploitation Workshop, Whistler Canada (2006)
    • Gelly,S.,Wang,Y.: Exploration exploitation in go: UCT for Monte-Carlo go. In:NIPS-2006:On-line trading of Exploration and Exploitation Workshop, Whistler Canada (2006)
  • 4
    • 0003915098 scopus 로고
    • Real-time learning and control using asynchronous dynamic programming
    • Technical report 91-57, Computer Science Department, University of Massachusetts
    • A.G. Barto, S.J. Bradtke, and S.P. Singh. Real-time learning and control using asynchronous dynamic programming. Technical report 91-57, Computer Science Department, University of Massachusetts, 1991.
    • (1991)
    • Barto, A.G.1    Bradtke, S.J.2    Singh, S.P.3
  • 6
    • 0036568025 scopus 로고    scopus 로고
    • Finite time analysis of the multiarmed bandit problem
    • P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite time analysis of the multiarmed bandit problem. Machine Learning, 47(2-3):235-256, 2002.
    • (2002) Machine Learning , vol.47 , Issue.2-3 , pp. 235-256
    • Auer, P.1    Cesa-Bianchi, N.2    Fischer, P.3
  • 9
    • 84898992015 scopus 로고    scopus 로고
    • G. Tesauro and G.R. Galperin. On-line policy improvement using Monte-Carlo search. In M.C. Mozer, M.I. Jordan, and T. Petsche, editors, NIPS 9, pages 1068-1074, 1997.
    • G. Tesauro and G.R. Galperin. On-line policy improvement using Monte-Carlo search. In M.C. Mozer, M.I. Jordan, and T. Petsche, editors, NIPS 9, pages 1068-1074, 1997.
  • 10
    • 0036146034 scopus 로고    scopus 로고
    • World-championship-caliber Scrabble
    • B. Sheppard. World-championship-caliber Scrabble. Artificial Intelligence, 134(1-2):241-275, 2002.
    • (2002) Artificial Intelligence , vol.134 , Issue.1-2 , pp. 241-275
    • Sheppard, B.1


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