메뉴 건너뛰기




Volumn , Issue , 2006, Pages 171-178

Complexity results for enhanced qualitative probabilistic networks

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY RESULTS; CONDITIONAL PROBABILITIES; IN NETWORKS; NP-HARD; PROBABILISTIC NETWORK; QUALITATIVE PROBABILISTIC NETWORKS; RELAXATION SCHEMES; TIME POLYNOMIALS;

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

References (8)
  • 1
    • 0025401005 scopus 로고
    • The Computational Complexity of Probabilistic Inference using Bayesian Belief Networks
    • G.F. Cooper. 1990. The Computational Complexity of Probabilistic Inference using Bayesian Belief Networks. Artificial Intelligence, 42(2):393-405.
    • (1990) Artificial Intelligence , vol.42 , Issue.2 , pp. 393-405
    • Cooper, G.F.1
  • 2
    • 0040318380 scopus 로고
    • Belief Propagation in Qualitative Probabilistic Networks
    • N. Piera Carrete and M.G. Singh, editors CIMNE: Barcelona
    • M.J. Druzdzel and M. Henrion. 1993a. Belief Propagation in Qualitative Probabilistic Networks. In N. Piera Carrete and M.G. Singh, editors, Qualitative Reasoning and Decision Technologies, CIMNE: Barcelona.
    • (1993) Qualitative Reasoning and Decision Technologies
    • Druzdzel, M.J.1    Henrion, M.2
  • 8
    • 0025471633 scopus 로고
    • Fundamental Concepts of Qualitative Probabilistic Networks
    • M.P. Wellman. 1990. Fundamental Concepts of Qualitative Probabilistic Networks. Artificial Intelligence, 44(3):257-303.
    • (1990) Artificial Intelligence , vol.44 , Issue.3 , pp. 257-303
    • Wellman, M.P.1


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