메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1905-1912

Multi-agent filtering with infinitely nested beliefs

Author keywords

[No Author keywords available]

Indexed keywords

'CURRENT; AGENT DOMAINS; APPROXIMATION SCHEME; CONSTANT TIME; FILTERING ALGORITHM; FILTERING PROBLEMS; MULTI AGENT; NESTED BELIEFS; SIMPLE++; UNKNOWN STATE;

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

References (10)
  • 3
    • 84976774564 scopus 로고
    • Reasoning about knowledge and probability
    • R. Fagin and J. Y. Halpern. Reasoning about knowledge and probability. Journal of the ACM, 41(2):340-367, 1994.
    • (1994) Journal of the ACM , vol.41 , Issue.2 , pp. 340-367
    • Fagin, R.1    Halpern, J.Y.2
  • 7
    • 0032073263 scopus 로고    scopus 로고
    • Planning and acting in partially observable stochastic domains
    • PII S000437029800023X
    • L. P. Kaelbling, M. L. Littman, and A. R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101:99-134, 1998. (Pubitemid 128387390)
    • (1998) Artificial Intelligence , vol.101 , Issue.1-2 , pp. 99-134
    • Kaelbling, L.P.1    Littman, M.L.2    Cassandra, A.R.3


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