메뉴 건너뛰기




Volumn 1, Issue , 2007, Pages 198-203

Approximate counting by sampling the backtrack-free search space

Author keywords

[No Author keywords available]

Indexed keywords

BACKTRACK-FREE SEARCH SPACE; BOOLEAN SATISFIABILITY PROBLEM; LOWER BOUND MEASURE; SAMPLESEARCH;

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

References (12)
  • 1
    • 36348977139 scopus 로고    scopus 로고
    • Bayardo, R., and Pehoushek, J. 2000. Counting models using connected components. In AAAI, 157-162. AAAI Press / The MIT Press.
    • Bayardo, R., and Pehoushek, J. 2000. Counting models using connected components. In AAAI, 157-162. AAAI Press / The MIT Press.
  • 2
    • 0001249662 scopus 로고    scopus 로고
    • Ais-bn: An adaptive importance sampling algorithm for evidential reasoning in large bayesian networks
    • Cheng, J., and Druzdzel, M. J. 2000. Ais-bn: An adaptive importance sampling algorithm for evidential reasoning in large bayesian networks. J. Artif. Intell Res. (JAIR) 13:155-188.
    • (2000) J. Artif. Intell Res. (JAIR) , vol.13 , pp. 155-188
    • Cheng, J.1    Druzdzel, M.J.2
  • 4
    • 1642312636 scopus 로고    scopus 로고
    • Mini-buckets: A general scheme for bounded inference
    • Dechter, R., and Rish, I. 2003. Mini-buckets: A general scheme for bounded inference. J. ACM 50(2): 107-153.
    • (2003) J. ACM , vol.50 , Issue.2 , pp. 107-153
    • Dechter, R.1    Rish, I.2
  • 5
    • 0001667705 scopus 로고
    • Bayesian inference in econometric models using monte carlo integration
    • Geweke, J. 1989. Bayesian inference in econometric models using monte carlo integration. Econometrica 57(6): 1317-39.
    • (1989) Econometrica , vol.57 , Issue.6 , pp. 1317-1339
    • Geweke, J.1
  • 6
    • 80053260506 scopus 로고    scopus 로고
    • Approximate inference algorithms for hybrid bayesian networks with discrete constraints
    • Gogate, V., and Dechter, R. 2005. Approximate inference algorithms for hybrid bayesian networks with discrete constraints. UAI-2005.
    • (2005) UAI-2005
    • Gogate, V.1    Dechter, R.2
  • 7
    • 36349023697 scopus 로고    scopus 로고
    • A new algorithm for sampling csp solutions uniformly at random
    • Gogate, V., and Dechter, R. 2006. A new algorithm for sampling csp solutions uniformly at random. CP.
    • (2006) CP
    • Gogate, V.1    Dechter, R.2
  • 10
    • 34547366652 scopus 로고    scopus 로고
    • Minisat vl.13-a sat solver with conflict-clause minimization
    • Sorensson, N., and Een, N. 2005. Minisat vl.13-a sat solver with conflict-clause minimization. In SAT 2005.
    • (2005) SAT 2005
    • Sorensson, N.1    Een, N.2
  • 11
    • 36349036218 scopus 로고    scopus 로고
    • A new approach to model counting
    • Wei, W., and Selman, B. 2005. A new approach to model counting. In SAT.
    • (2005) SAT
    • Wei, W.1    Selman, B.2
  • 12
    • 33748255514 scopus 로고    scopus 로고
    • Importance sampling algorithms for Bayesian networks: Principles and performance
    • Yuan, C., and Druzdzel, M. J. 2006. Importance sampling algorithms for Bayesian networks: Principles and performance. Mathematical and Computer Modelling.
    • (2006) Mathematical and Computer Modelling
    • Yuan, C.1    Druzdzel, M.J.2


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