Probabilistically estimating backbones and variable bias: Experimental overview

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5202 LNCS, Issue , 2008, Pages 613-617

  Hsu, Eric I ^a   Muise, Christian J ^a   Beck, J Christopher ^a   McIlraith, Sheila A ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BACKTRACKING SEARCHES; BELIEF PROPAGATIONS; BIAS ESTIMATIONS; BOOLEAN SATISFIABILITY; CONSTRAINT SATISFACTION PROBLEMS; EFFICIENT SEARCHES; EXPECTATION MAXIMIZATIONS; PROBLEM HARDNESSES; RANDOM PROBLEMS; SAT SOLVERS; SEARCH EFFICIENCIES; SEARCH HEURISTICS; SURVEY PROPAGATIONS;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; MESSAGE PASSING;

BOOLEAN FUNCTIONS;

EID: 56449089907     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85958-1_52     Document Type: Conference Paper

References (14)

1. Hsu, E., Muise, C., Beck, J.C., Mcllraith, S.: Applying probabilistic inference to heuristic search by estimating variable bias. Technical Report CSRG-577, University of Toronto (2008)
2. Braunstein, A., Mezard, M., Zecchina, R.: Survey propagation: An algorithm for satisfiability. Random Structures and Algorithms 27, 201-226 (2005)
3. Dechter, R., Kask, K., Mateescu, R.: Iterative join-graph propagation. In: Proc. of 18th Int'l Conference on Uncertainty in A.I (UAI 2002), Edmonton, Canada, pp. 128-136 (2002)
4. Hsu, E., Kitching, M., Bacchus, E, Mcllraith, S.: Using EM to find likely assignments for solving CSP's. In: Proc. of 22nd National Conference on Artificial Intelligence (AAAI2007), Vancouver, Canada (2007)
5. Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic phase transitions. Nature 400(7), 133-137 (1999)
6. Kilby, P., Slaney, J., Thiébaux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: Proc. of 20th National Conference on A.I (AAAI 2005), Pittsburgh, PA (2005)
7. Singer, J., Gent, I., Smaill, A.: Backbone fragility and the local search cost peak. Journal of Artificial Intelligence Research 12, 235-270 (2000)
8. Dubois, O., Dequen, G.: A backbone-search heuristic for efficient solving of hard 3-SAT formulae. In: Proc. of 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), Seattle, WA (2001)
9. Zhang, W.: Configuration landscape analysis and backbone guided local search. Part I: Satisfiability and maximum satisfiability. Artificial Intelligence 158(1), 1-26 (2004)
10. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
11. Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Francisco (1988)
12. Kschischang, F.R., Frey, B.J., Loeliger, H.A.: Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory 47(2) (2001)
13. Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society 39(1), 1-39 (1977)
14. Jordan, M., Ghahramani, Z., Jaakkola, T., Saul, L.: An introduction to variational methods for graphical models. In: Jordan, M. (ed.) Learning in Graphical Models. MIT Press, Cambridge (1998)