메뉴 건너뛰기




Volumn 4222 LNCS - II, Issue , 2006, Pages 948-957

Solving uncertain Markov decision problems: An interval-based method

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING;

EID: 33750335294     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11881223_120     Document Type: Conference Paper
Times cited : (6)

References (9)
  • 1
    • 0035369425 scopus 로고    scopus 로고
    • LAO©: A heuristic search algorithm that finds solutions with loops
    • Eric A. Hansen, and Shlomo Ziberstein. LAO©: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence 129(2001)35-62
    • (2001) Artificial Intelligence , vol.129 , pp. 35-62
    • Hansen, E.A.1    Ziberstein, S.2
  • 2
    • 1942450194 scopus 로고    scopus 로고
    • Technical Report CMU-RI-TR-01-25, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, August
    • J.A. Bagnell, A. Y. Ng, and J. Schneider. Solving uncertain markov decision problems. Technical Report CMU-RI-TR-01-25, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, August 2001.
    • (2001) Solving Uncertain Markov Decision Problems
    • Bagnell, J.A.1    Ng, A.Y.2    Schneider, J.3
  • 5
    • 0034272032 scopus 로고    scopus 로고
    • Bounded parameter markov decision processes
    • R. Givan, S. Leach, and T. Dean. Bounded parameter markov decision processes. Artificial Intelligence, 122(1-2):71-109, 2000.
    • (2000) Artificial Intelligence , vol.122 , Issue.1-2 , pp. 71-109
    • Givan, R.1    Leach, S.2    Dean, T.3
  • 8
    • 0018046320 scopus 로고
    • Optimizing decision trees through heuristically guided search
    • A. Martelli, U. Montanari, Optimizing decision trees through heuristically guided search. Comm. ACM 21 (12) (1978) 1025-1039.
    • (1978) Comm. ACM , vol.21 , Issue.12 , pp. 1025-1039
    • Martelli, A.1    Montanari, U.2


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