Statistical regimes across constrainedness regions

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

Volumn 3258, Issue , 2004, Pages 32-46

  Gomes, Carla P ^a   Fernández, Cèsar ^b   Selman, Bart ^a   Bessiere, Christian ^c  

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

^b UNIVERSITY OF LLEIDA   (Spain)

^c LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; HARDNESS; QUEUEING NETWORKS;

EXPONENTIAL DISTRIBUTIONS; HEAVY-TAILED BEHAVIOR; HIGHLY-CORRELATED; PROBLEM HARDNESS; RANDOMIZED BACKTRACK SEARCH; RUNTIME DISTRIBUTIONS; SEARCH PROCEDURES; TYPICAL CASE COMPLEXITY;

CONSTRAINT THEORY;

EID: 35048828430     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_6     Document Type: Article

References (17)

1. Hogg, T., Huberman, B., Williams, C.: Phase Transitions and Search Problems. Artificial Intelligence 81 (1-2) (1996) 1-15
2. Gent, I., Walsh, T.: Easy Problems are Sometimes Hard. Artificial Intelligence 70 (1994) 335-345
3. Hogg, T., Williams, C.: The Hardest Constraint Problems: a Double Phase Transition. Artificial Intelligence 69 (1994) 359-377
4. Smith, B., Grant, S.: Sparse Constraint Graphs and Exceptionally Hard Problems. In: Proceedings IJCAI'95, Montreal, Canada (1995) 646-651
5. Selman, B., Kirkpatrick, S.: Finite-Size Scaling of the Computational Cost of Systematic Search. Artificial Intelligence 81 (1996) 273-295
6. Smith, B., Grant, S.: Modelling Exceptionally Hard Constraint Satisfaction Problems. In: Proceedings CP'97, Linz, Austria (1997) 182-195
7. Frost, D., Rish, I., Vila, L.: Summarizing CSP Hardness with Continuous Probability Distributions. In: AAAI-97, Providence RI (1997) 327-333
8. Gomes, C., Selman, B., Crato, N.: Heavy-tailed Distributions in Combinatorial Search. In: Proceedings CP'97, Linz, Austria (1997) 121-135
9. Hoos, H. PhD Thesis, TU Darmstadt (1998)
10. Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)
11. Chen, H., Gomes, C., Selman, B.: Formal Models of Heavy-tailed Behavior in Combinatorial Search. In: Proceedings CP'01, Paphos, Cyprus (2001) 408-421
12. Williams, R., Gomes, C., Selman, B.: Backdoors to Typical Case Complexity. (2003)
13. Walsh, T.: SAT vs CSP. In: Proceedings CP'00, Singapore (2000) 441-456
14. Achlioptas, D., Kirousis, L., Kranakis, E., Krizanc, D., Molloy, M., Stamatiou, Y.: Random Constraint Satisfaction: a More Accurate Picture. In: Proceedings CP'97, Linz, Austria (1997) 107-120
15. Xu, K., Li, W.: Exact Phase Transition in Random Constraint Satisfaction Problems. JAIR 12 (2000) 93-103
16. Bessière, C., Zanuttini, B., Fernández, C.: Measuring Search Trees. In Hnich, B., ed.: Proceedings ECAI'04 Workshop on Modelling and Solving Problems with Constraints, Valencia, Spain (2004)
17. Li, C., Ambulagan: Heuristics Based on Unit Propagation for Satisfiability Problems. In: Proceedings IJCAI'97, Nagoya, Japan (1997) 366-371