메뉴 건너뛰기




Volumn , Issue , 2009, Pages 26-33

Lower bounding Klondike solitaire with Monte-Carlo planning

Author keywords

[No Author keywords available]

Indexed keywords

CARD GAMES; CONFIDENCE INTERVAL; LOWER BOUNDS; MONTE CARLO; PLANNING LANGUAGES; PROBABILISTIC PLANNING; SAMPLE COMPLEXITY; SAMPLING-BASED PLANNING; SPARSE SAMPLING; THEORETICAL BOUNDS;

EID: 77958561606     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (79)

References (11)
  • 5
    • 0036832951 scopus 로고    scopus 로고
    • A sparse sampling algorithm for near-optimal planning in large Markov decision processes
    • DOI 10.1023/A:1017932429737
    • Kearns, M.; Mansour, Y.; and Ng, A. 2002. A sparse sampling algorithm for near-optimal planning in large markov decision processes. Machine Learning 49:193-208. (Pubitemid 34325686)
    • (2002) Machine Learning , vol.49 , Issue.2-3 , pp. 193-208
    • Kearns, M.1    Mansour, Y.2    Ng, A.Y.3
  • 10
    • 57749193939 scopus 로고    scopus 로고
    • Probabilistic planning via determinization in hindsight
    • Yoon, S.; Fern, A.; Givan, R.; and Kambhampati, S. 2008. Probabilistic planning via determinization in hindsight. In AAAI-2008, 1010-1016.
    • (2008) AAAI-2008 , pp. 1010-1016
    • Yoon, S.1    Fern, A.2    Givan, R.3    Kambhampati, S.4


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