-
1
-
-
36348989663
-
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
-
2
-
-
84880852942
-
From sampling to model counting
-
Gomes, C., Hoffmann, J., Sabharwal, A., Selman, B.: From sampling to model counting. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence, IJCAI 2007 (2007)
-
Proceedings of the 20th International Joint Conference on Artificial Intelligence, IJCAI 2007 (2007)
-
-
Gomes, C.1
Hoffmann, J.2
Sabharwal, A.3
Selman, B.4
-
3
-
-
33750707563
-
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
-
4
-
-
0035478853
-
Stochastic boolean satisfiability
-
Littman, M., Majercik, S., Pitassi, T.: Stochastic boolean satisfiability. Journal of Automated Reasoning 27(3), 251-296 (2001)
-
(2001)
Journal of Automated Reasoning
, vol.27
, Issue.3
, pp. 251-296
-
-
Littman, M.1
Majercik, S.2
Pitassi, T.3
-
5
-
-
29344449175
-
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
-
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
-
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
-
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
-
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
-
10
-
-
9444265261
-
Towards efficient sampling: Exploiting random walk strategies
-
AAAI Press, Menlo Park
-
Wei, W., Erenrich, J., Selman, B.: Towards efficient sampling: Exploiting random walk strategies. In: Proceedings of the 19th National Conference on Artifical Intelligence, pp. 670-676. AAAI Press, Menlo Park (2004)
-
(2004)
Proceedings of the 19th National Conference on Artifical Intelligence
, pp. 670-676
-
-
Wei, W.1
Erenrich, J.2
Selman, B.3
-
11
-
-
0002461628
-
Tail bounds for occupancy and the satisfiability threshold conjecture
-
Kamath, A., Motwani, R., Palem, K., Spirakis, P.: Tail bounds for occupancy and the satisfiability threshold conjecture. In: Proc. of the 35th Annual Symposium on the Foundations of Computer Science, pp. 592-603 (1994)
-
(1994)
Proc. of the 35th Annual Symposium on the Foundations of Computer Science
, pp. 592-603
-
-
Kamath, A.1
Motwani, R.2
Palem, K.3
Spirakis, P.4
-
12
-
-
0000454015
-
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
-
14
-
-
26444558125
-
Combining component caching and clause learning for effective model counting
-
Sang, T., Bacchus, F., Beame, P., Kautz, H., Pitassi, T.: Combining component caching and clause learning for effective model counting. In: Proc. of SAT 2004 (2004)
-
Proc. of SAT 2004 (2004)
-
-
Sang, T.1
Bacchus, F.2
Beame, P.3
Kautz, H.4
Pitassi, T.5
|