Formal models of heavy-tailed behavior in combinatorial search

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

Volumn 2239, Issue , 2001, Pages 408-421

  Chen, Hubie ^a   Gomes, Carla ^a   Selman, Bart ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

COMBINATORIAL SEARCH; COST DISTRIBUTION; HEAVY-TAILED BEHAVIOR; HEAVY-TAILED DISTRIBUTION; RANDOMIZED BACKTRACK SEARCH; RESTART MECHANISM; RESTART STRATEGY; SEARCH PERFORMANCE;

CONSTRAINT THEORY;

EID: 84947916483     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_28     Document Type: Conference Paper

References (13)

1. R. Bayardo and R. Schrag. Using csp look-back techniques to solve real-world sat instances. In Proc. of the 14th Natl. Conf. on Artificial Intelligence (AAAI-97), pages 203–208, New Providence, RI, 1997. AAAI Press.
2. J. M. Crawford, M. J. Kearns, and R. E. Schapire. The minimal disagreement parity problem as a hard satisfiability problem. Technical report (also in dimacs sat benchmark), CIRL, 1994.
3. C. Gomes, B. Selman, and N. Crato. Heavy-tailed Distributions in Combinatorial Search. In G. Smolka, editor, Princp. and practice of Constraint Programming (CP97). Lect. Notes in Comp. Sci., pages 121–135. Springer-Verlag, 1997.
4. C. Gomes, B. Selman, and H. Kautz. Boosting Combinatorial Search Through Randomization. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), pages 431–438, New Providence, RI, 1998. AAAI Press.
5. C. P. Gomes, B. Selman, N. Crato, and H. Kautz. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. of Automated Reasoning, 24(1–2):67–100, 2000.
6. M. Harchol-Balter, M. Crovella, and C. Murta. On choosing a task assignment policy for a distributed server system. In Proceedings of Performance Tools’98, pages 231–242. Springer-Verlag, 1998.
7. I. Jacobs and E. Berlekamp.: A lower bound to the distribution of computation for sequential decoding. IEEE Trans. Inform. Theory, pages 167–174, 1963.
8. C. M. Li. A constrained-based approach to narrow search trees for satisfiability. Information processing letters, 71:75–80, 1999.
9. C. M. Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 366–371. AAAI Pess, 1997.
10. M. Luby, A. Sinclair, and D. Zuckerman.: Optimal speedup of las vegas algorithms. Information Process. Letters, pages 173–180, 1993.
11. J. P. Marques-Silva and K. A. Sakallah. Grasp - a search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5):506–521, 1999.
12. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient sat solver. In Proc. of the 39th Design Automation Conf., 2001.
13. T. Walsh. Search in a small world. In IJCAI-99, 1999.