메뉴 건너뛰기




Volumn , Issue , 2005, Pages 380-387

The relationship between AND/OR search and Variable Elimination

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; GRAPH ALGORITHMS;

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

References (14)
  • 1
    • 0021787868 scopus 로고
    • Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey
    • S. A. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT, 25:2-23, 1985.
    • (1985) BIT , vol.25 , pp. 2-23
    • Arnborg, S.A.1
  • 2
    • 0345007724 scopus 로고    scopus 로고
    • Enhancing davis putnam with extended binary clause reasoning
    • F. Bacchus. Enhancing davis putnam with extended binary clause reasoning. In AAAI-02, 2002.
    • (2002) AAAI-02
    • Bacchus, F.1
  • 3
    • 0345712235 scopus 로고    scopus 로고
    • Value elimination: Bayesian inference via backtracking search
    • F. Bacchus, S. Dalmao, and T. Pitassi. Value elimination: Bayesian inference via backtracking search. In UAI'03, 2003.
    • (2003) UAI'03
    • Bacchus, F.1    Dalmao, S.2    Pitassi, T.3
  • 4
    • 80053271756 scopus 로고    scopus 로고
    • A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem
    • R. Bayardo and D. Miranker. A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem. In AAAI'96, 1996.
    • (1996) AAAI'96
    • Bayardo, R.1    Miranker, D.2
  • 7
    • 0035250750 scopus 로고    scopus 로고
    • Recursive conditioning
    • DOI 10.1016/S0004-3702(00)00069-2
    • A. Darwiche. Recursive conditioning. Artificial Intelligence Journal, 125(1-2):5-41, 2001. (Pubitemid 32196230)
    • (2001) Artificial Intelligence , vol.126 , Issue.1-2 , pp. 5-41
    • Darwiche, A.1
  • 8
    • 0033188982 scopus 로고    scopus 로고
    • Bucket elimination: A unifying framework for reasoning
    • DOI 10.1016/S0004-3702(99)00059-4
    • R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113:41-85, 1999. (Pubitemid 30542742)
    • (1999) Artificial Intelligence , vol.113 , Issue.1 , pp. 41-85
    • Dechter, R.1
  • 11
    • 33646197085 scopus 로고    scopus 로고
    • Mixtures of deterministicprobabilistic networks and their AND/OR search space
    • R. Dechter and R. Mateescu. Mixtures of deterministicprobabilistic networks and their AND/OR search space. In UAI'04, 2004.
    • (2004) UAI'04
    • Dechter, R.1    Mateescu, R.2
  • 12
    • 0003815444 scopus 로고
    • Taking advantage of stable sets of variables in constraint satisfaction problems
    • E. C. Freuder and M. J. Quinn. Taking advantage of stable sets of variables in constraint satisfaction problems. In IJCAI'85, 1985.
    • (1985) IJCAI'85
    • Freuder, E.C.1    Quinn, M.J.2


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