메뉴 건너뛰기




Volumn 6308 LNCS, Issue , 2010, Pages 38-52

Computing the density of states of boolean formulas

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; MARKOV PROCESSES; MONTE CARLO METHODS;

EID: 78149243212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15396-9_6     Document Type: Conference Paper
Times cited : (7)

References (15)
  • 1
    • 36348989663 scopus 로고    scopus 로고
    • Approximate counting by sampling the backtrack-free search space
    • Gogate, V., Dechter, R.: Approximate counting by sampling the backtrack-free search space. In: Proc. of AAAI-2007, pp. 198-203 (2007)
    • (2007) Proc. of AAAI-2007 , pp. 198-203
    • Gogate, V.1    Dechter, R.2
  • 3
    • 33750707563 scopus 로고    scopus 로고
    • Model counting: A new strategy for obtaining good bounds
    • AAAI Press, Menlo Park
    • Gomes, C., Sabharwal, A., Selman, B.: Model counting: a new strategy for obtaining good bounds. In: Proceedings of AAAI 2006, pp. 54-61. AAAI Press, Menlo Park (2006)
    • (2006) Proceedings of AAAI 2006 , pp. 54-61
    • Gomes, C.1    Sabharwal, A.2    Selman, B.3
  • 5
    • 29344449175 scopus 로고    scopus 로고
    • Solving Bayesian networks by weighted model counting
    • Sang, T., Beame, P., Kautz, H.: Solving Bayesian networks by weighted model counting. In: Proc. of AAAI 2005, pp. 475-481 (2005)
    • (2005) Proc. of AAAI 2005 , pp. 475-481
    • Sang, T.1    Beame, P.2    Kautz, H.3
  • 6
    • 0025260212 scopus 로고
    • Algorithms for the maximum satisfiability problem
    • Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 44(4), 279-303 (1990)
    • (1990) Computing , vol.44 , Issue.4 , pp. 279-303
    • Hansen, P.1    Jaumard, B.2
  • 7
    • 6644221271 scopus 로고    scopus 로고
    • Efficient, multiple-range random walk algorithm to calculate the density of states
    • DOI 10.1103/PhysRevLett.86.2050
    • Wang, F., Landau, D.: Efficient, multiple-range random walk algorithm to calculate the density of states. Physical Review Letters 86(10), 2050-2053 (2001) (Pubitemid 32254758)
    • (2001) Physical Review Letters , vol.86 , Issue.10 , pp. 2050-2053
    • Wang, F.1    Landau, D.P.2
  • 8
    • 84959043517 scopus 로고    scopus 로고
    • Sat, local search dynamics and density of states
    • Selected Papers from the Springer, Heidelberg
    • Belaidouni, M., Hao, J.K.: Sat, local search dynamics and density of states. In: Selected Papers from the 5th European Conference on Artificial Evolution, pp. 192-204. Springer, Heidelberg (2002)
    • (2002) 5th European Conference on Artificial Evolution , pp. 192-204
    • Belaidouni, M.1    Hao, J.K.2
  • 9
    • 84958972589 scopus 로고    scopus 로고
    • The Density of States - A Measure of the Difficulty of Optimisation Problems
    • Parallel Problem Solving from Nature - PPSN IV
    • Rosé, H., Ebeling, W., Asselmeyer, T.: The density of states - a measure of the difficulty of optimisation problems. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 208-217. Springer, Heidelberg (1996) (Pubitemid 126128309)
    • (1996) LECTURE NOTES in COMPUTER SCIENCE , Issue.1141 , pp. 208-217
    • Rose, H.1    Ebeling, W.2    Asselmeyer, T.3
  • 12
    • 0000454015 scopus 로고    scopus 로고
    • Entropy of the K-satisfiability problem
    • Monasson, R., Zecchina, R.: Entropy of the K-satisfiability problem. Physical review letters 76(21), 3881-3885 (1996)
    • (1996) Physical Review Letters , vol.76 , Issue.21 , pp. 3881-3885
    • Monasson, R.1    Zecchina, R.2


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