메뉴 건너뛰기




Volumn , Issue , 2011, Pages 655-661

Real-time solving of quantified CSPs based on Monte-Carlo game tree search

Author keywords

[No Author keywords available]

Indexed keywords

ALPHA-BETA SEARCHES; CONSTRAINT PROPAGATION TECHNIQUE; LARGE-SCALE PROBLEM; QUANTIFIED CONSTRAINT SATISFACTION PROBLEMS; REAL TIME ALGORITHMS; STATE-OF-THE-ART ALGORITHMS; STATIC EVALUATION; WINNING PROBABILITY;

EID: 84858986652     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-116     Document Type: Conference Paper
Times cited : (28)

References (13)
  • 1
    • 0036568025 scopus 로고    scopus 로고
    • Finite-time analysis of the multiarmed bandit problem
    • DOI 10.1023/A:1013689704352, Computational Learning Theory
    • P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2-3):235-256, 2002. (Pubitemid 34126111)
    • (2002) Machine Learning , vol.47 , Issue.2-3 , pp. 235-256
    • Auer, P.1    Cesa-Bianchi, N.2    Fischer, P.3
  • 2
    • 84881068955 scopus 로고    scopus 로고
    • Cooperative problem solving against adversary: Quantified distributed constraint satisfaction problem
    • S. Baba, A. Iwasaki, M. Yokoo, M. C. Silaghi, K. Hirayama, and T. Matsui. Cooperative problem solving against adversary: quantified distributed constraint satisfaction problem. In AAMAS, pages 781-788, 2010.
    • (2010) AAMAS , pp. 781-788
    • Baba, S.1    Iwasaki, A.2    Yokoo, M.3    Silaghi, M.C.4    Hirayama, K.5    Matsui, T.6
  • 3
    • 38149075938 scopus 로고    scopus 로고
    • Solution directed backjumping for QCSP
    • F. Bacchus and K. Stergiou. Solution directed backjumping for QCSP. In CP, pages 148-163, 2007.
    • (2007) CP , pp. 148-163
    • Bacchus, F.1    Stergiou, K.2
  • 4
    • 84957036580 scopus 로고    scopus 로고
    • Beyond NP: Arc-consistency for quantified constraints
    • L. Bordeaux and E. Monfroy. Beyond NP: Arc-consistency for quantified constraints. In CP, pages 371-386, 2002.
    • (2002) CP , pp. 371-386
    • Bordeaux, L.1    Monfroy, E.2
  • 6
    • 38049037928 scopus 로고    scopus 로고
    • Efficient selectivity and backup operators in monte-carlo tree search
    • R. Coulom. Efficient selectivity and backup operators in monte-carlo tree search. In CG, pages 72-83, 2006.
    • (2006) CG , pp. 72-83
    • Coulom, R.1
  • 7
    • 57749181518 scopus 로고    scopus 로고
    • Simulation-based approach to general game playing
    • H. Finnsson and Y. Björnsson. Simulation-based approach to general game playing. In AAAI, pages 259-264, 2008.
    • (2008) AAAI , pp. 259-264
    • Finnsson, H.1    Björnsson, Y.2
  • 8
    • 84880758665 scopus 로고    scopus 로고
    • QCSP-Solve: A solver for quantified constraint satisfaction problems
    • I. P. Gent, P. Nightingale, and K. Stergiou. QCSP-Solve: A solver for quantified constraint satisfaction problems. In IJCAI, pages 138-143, 2005.
    • (2005) IJCAI , pp. 138-143
    • Gent, I.P.1    Nightingale, P.2    Stergiou, K.3
  • 9
    • 33750293964 scopus 로고    scopus 로고
    • Bandit based monte-carlo planning
    • L. Kocsis and C. Szepesvári. Bandit based monte-carlo planning. In ECML, pages 282-293, 2006.
    • (2006) ECML , pp. 282-293
    • Kocsis, L.1    Szepesvári, C.2
  • 10
    • 0000959937 scopus 로고
    • Constraint satisfaction
    • S. C. Shapiro, editor, John Wiley & Sons
    • A. K. Mackworth. Constraint satisfaction. In S. C. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 285-293. John Wiley & Sons, 1992.
    • (1992) Encyclopedia of Artificial Intelligence , pp. 285-293
    • Mackworth, A.K.1
  • 12
    • 70350761423 scopus 로고    scopus 로고
    • Realtime online solving of quantified CSPs
    • D. Stynes and K. N. Brown. Realtime online solving of quantified CSPs. In CP, pages 771-786, 2009.
    • (2009) CP , pp. 771-786
    • Stynes, D.1    Brown, K.N.2


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