메뉴 건너뛰기




Volumn , Issue , 2010, Pages 268-276

Beem : BBucket Elimination with external memory

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

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

References (10)
  • 2
    • 0035250750 scopus 로고    scopus 로고
    • Recursive conditioning
    • DOI 10.1016/S0004-3702(00)00069-2
    • A. Darwiche. Recursive conditioning. Artificial Intelligence, 126(1-2):5-41, 2001. (Pubitemid 32196230)
    • (2001) Artificial Intelligence , vol.126 , Issue.1-2 , pp. 5-41
    • Darwiche, A.1
  • 4
    • 33847283947 scopus 로고    scopus 로고
    • AND/OR search spaces for graphical models
    • DOI 10.1016/j.artint.2006.11.003, PII S000437020600138X
    • R. Dechter and R. Mateescu. And/or search spaces for graphical models. Artif. Intell., 171(2-3):73-106, 2007. (Pubitemid 46328845)
    • (2007) Artificial Intelligence , vol.171 , Issue.2-3 , pp. 73-106
    • Dechter, R.1    Mateescu, R.2
  • 5
    • 21444441210 scopus 로고    scopus 로고
    • Unifying tree decompositions for reasoning in graphical models
    • DOI 10.1016/j.artint.2005.04.004, PII S0004370205000639
    • K. Kask et al. Unifying cluster-tree decompositions for reasoning in graphical models. Artificial Intelligence, 166:165-193, 2005. (Pubitemid 40915125)
    • (2005) Artificial Intelligence , vol.166 , Issue.1-2 , pp. 165-193
    • Kask, K.1    Dechter, R.2    Larrosa, J.3    Dechter, A.4
  • 6
    • 57949111257 scopus 로고    scopus 로고
    • Linear-time disk-based implicit graph search
    • R.E. Korf. Linear-time disk-based implicit graph search. J. ACM, 55(6):1-40, 2008.
    • (2008) J. ACM , vol.55 , Issue.6 , pp. 1-40
    • Korf, R.E.1
  • 7
    • 57749168341 scopus 로고    scopus 로고
    • Minimizing disk i/o in two-bit breadth-first search
    • AAAI Press
    • R.E. Korf. Minimizing disk i/o in two-bit breadth-first search. In Proc. of 23rd Natl. Conf. on AI, pages 317-324. AAAI Press, 2008.
    • (2008) Proc. of 23rd Natl. Conf. on AI , pp. 317-324
    • Korf, R.E.1
  • 8
    • 0041781747 scopus 로고    scopus 로고
    • Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
    • J. Larrosa and R. Dechter. Boosting search with variable elimination in constraint optimization and constraint satisfaction problems. Constraints, 8(3):303-326, 2003.
    • (2003) Constraints , vol.8 , Issue.3 , pp. 303-326
    • Larrosa, J.1    Dechter, R.2
  • 10
    • 0008533155 scopus 로고
    • Global conditioning for probabilistic inference in belief networks
    • R.D. Shachter and S.K. Andersen. Global conditioning for probabilistic inference in belief networks. In Proc. 10th Conf. on Uncert. in AI, pages 514-522, 1994.
    • (1994) Proc. 10th Conf. on Uncert. in AI , pp. 514-522
    • Shachter, R.D.1    Andersen, S.K.2


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