Random constraint satisfaction: Flaws and structure

Constraints

Volumn 6, Issue 4, 2001, Pages 345-372

  Gent, Ian P ^a   Macintyre, Ewan ^b   Prosser, Patrick ^c   Smith, Barbara M ^d   Walsh, Toby ^e  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

^b CISCO SYSTEMS   (United States)

^c UNIVERSITY OF GLASGOW   (United Kingdom)

^d UNIVERSITY OF HUDDERSFIELD   (United Kingdom)

^e UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Benchmarking; Constraint satisfaction; Phase transitions; Random problems

Indexed keywords

BENCHMARKING; BINARY SEQUENCES; COMPUTER SIMULATION; GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING; RANDOM PROCESSES;

RANDOM CONSTRAINT SATISFACTION PROBLEMS (CSP); RANDOM GRAPHS;

CONSTRAINT THEORY;

EID: 0035479063     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011454308633     Document Type: Article

References (60)

1. Random constraint satisfaction: A more accurate picture
2. On the forward checking algorithm
3. Dynamic variable ordering in CSP's
4. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems
5. Adaptive constraint satisfaction: The quickest first principle
6. Using mean field methods for boosting backtrack search in constraint satisfaction problems
7. Where the really hard problems are
8. Path-consistency: When space misses time
9. Local search and the number of solutions
10. From restricted path consistency to max-restricted path consistency
11. Some practicable filtering techniques for the constraint satisfaction problem
12. A sufficient condition for backtrack-free search
13. Neighbourhood inverse consistency preprocessing
14. Extracting constraint satisfaction subproblems
15. Analysis of two simple heuristics on a random instance of k-SAT
16. Dead-end driven learning
17. In search of the best search: An empirical evaluation
18. Look-ahead value ordering for constraint satisfaction problems
19. Summarizing CSP hardness with continuous probability distributions
20. Tabu search for maximal constraint satisfaction problems
21. Detecting unsatisfiable CSPs by coloring the microstructure
22. The constrainedness of arc consistency
23. An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem
24. Scaling effects in the CSP phase transition
25. The constrainedness of search
26. The scaling of search cost
27. The logic of search algorithms: Theory and applications
28. Phase transitions from real computational problems
29. Analysis of heuristics for number partitioning
30. Problem structure in the presense of perturbations
31. The phase transition behaviour of maintaining arc consistency
32. The phase transition behaviour of maintaining arc consistency
33. Gsat and local consistency
34. A graph-based method for improving GSAT
35. Approximating the unsatisfiability threshold of random formulas
36. Predicting phase transitions of binary CSPs with constraint graph information
37. Optimization-based heuristics for maximal constraint satisfaction
38. Exploiting the use of DAC in MAX-CSP
39. Phase transition in MAX-CSP
40. Maximal sets of solutions for constraint satisfaction problems
41. Bayes networks for estimating the number of solutions to a CSP
42. Constraint satisfaction as global optimization
43. Hard and easy distributions of SAT problems
44. Binary constraint satisfaction problmes: Some are harder than others
45. Statistical analysis of backtracking on inconsistent CSPs
46. Contradicting conventional wisdom in constraint satisfaction
47. Understanding and improving the mac algorithm
48. Phase transition and the mushy region in constraint satisfaction problems
49. Locating the phase transition in binary constraint satisfaction problems
50. Where the exceptionally hard problems are
51. Modelling exceptionally hard constraint satisfaction problems
52. Sparse constraint graphs and exceptionally hard problems
53. Constructing an asymptotic phase transition in random binary constraint satisfaction problems
54. Analysis of heuristic methods for partial constraint satisfaction problems
55. Exploiting the deep structure of constraint problems
56. Exact phase transitions in random constraint satisfaction problems
57. Improving repair-based constraint satisfaction methods by value propagation