Phase transitions and the search problem

Artificial Intelligence

Volumn 81, Issue 1-2, 1996, Pages 1-15

  Hogg, Tad ^a   Huberman, Bernardo A ^a   Williams, Colin P ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; PROBLEM SOLVING; TOPOLOGY;

CONSTRAINT SATISFACTION; PHYSICAL PHASE TRANSITIONS; SEARCH PROBLEM; SEARCH SPACE TOPOLOGY;

ARTIFICIAL INTELLIGENCE;

EID: 0030105044     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(95)00044-5     Document Type: Editorial

References (59)

1. A.B. Baker Intelligent backtracking on the hardest constraint problems J. Artif. Intett. Res. 1995
2. B. Bollobas 2nd ed. Random Graphs 1985 Academic Press New York
3. T. Bylander An average case analysis of planning Proceedings AAAI-93 Washington, DC 1993 480 485
4. M.T. Chao J. Franco Probabilistic analysis of a generalization of the unit-clause literal selection heuristics Information Sci. 51 1990 289 314
5. P. Cheeseman B. Kanefsky W.M. Taylor Where the really hard problems are J. Mylopoulos R. Reiter Proceedings IJCAI-91 Sydney, Australia 1991 331 337
6. P. Cheeseman B. Kanefsky W.M. Taylor Computational complexity and phase transitions Proceedings Physics of Computation Workshop 1992 63 68
7. P.C. Chen Heuristic sampling: a method for predicting the performance of tree searching programs SIAM J. Computing 21 2 1992 295 315 April
8. J.M. Crawford L.D. Auton Experimental results on the cross-over point in satisfiability problems Proceedings AAAI-93 Washington, DC 1993 21 27
9. Percolation Structures and Processes 2nd ed. G. Deutscher R. Zallen J. Adler Annals of the Israel Physical Society 5 1983 Adam Hilger Bristol
10. M.E. Fisher J.W. Essam Some cluster size and percolation problems J. Math. Phys. 2 4 1961 609 619
11. J. Frank Phase transitions in NP-hard problem spaces Ph.D. Qualifying Exam Paper 1995
12. M.R. Garey D.S. Johnson 2nd ed. A Guide to the Theory of NP-Completeness 1979 Freeman San Francisco, CA
13. I.P. Gent T. Walsh Easy problems are sometimes hard Artif. Intett. 70 1994 335 345
14. D.L. Goodstein 2nd ed. States of Matter 1975 Prentice-Hall Englewood Cliffs, NJ
15. C. Gotsman A cluster detection algorithm based on percolation theory Pattern Recogn. Lett. 12 1991 199 202
16. J. Hasselberg P.M. Pardalos G. Vairaktarakis Test case generators and computational results for the maximum clique problem 2nd ed. Technical Report 1992 University of Florida
17. T. Hogg Phase transitions in constraint satisfaction search 1994 World Wide Web page with URL ftp://parcftp.xerox.com/pub/dynamics/constraints.html
18. T. Hogg Applications of statistical mechanics to combinatorial search problems 2nd ed. D. Stauffer Annual Reviews of Computational Physics 2 1995 World Scientific Singapore 357 406
19. T. Hogg Exploiting problem structure as a search heuristic 2nd ed. Technical Report 1995 Xerox PARC Palo Alto, CA
20. T. Hogg, Quantum computing and phase transitions in combinatorial search, J. Artif. Intell. Res. (to appear).
21. T. Hogg B.A. Huberman Artificial intelligence and large scale computation: A physics perspective Phys. Reports 156 1987 227 310
22. T. Hogg J.O. Kephart Phase transitions in high-dimensional pattern classification Comput. Syst. Sci. Eng. 5 4 1990 223 232
23. T. Hogg C.P. Williams Solving the really hard problems with cooperative search Proceedings AAAI-93 Washington, DC 1993 231 236
24. T. Hogg C.P. Williams Expected gains from parallelizing constraint solving for hard problems Proceedings AAAI-94 Seattle, WA 1994 331 336
25. T. Hogg C.P. Williams The hardest constraint problems: a double phase transition Artif. Intell. 69 1994 359 377
26. J.H. Holland 2nd ed. Adaptation in Natural and Artificial Systems 1975 University of Michigan Press Ann Arbor, MI
27. B.A. Huberman T. Hogg Phase transitions in artificial intelligence systems Artif. Intell. 33 1987 155 171
28. M.T. Jones P.E. Plassmann A parallel graph coloring heuristic SIAM J. Sci. Comput. 14 3 1993 654 669
29. A. Kamath R. Motwani K. Palem P. Spirakis Tail bounds for occupancy and the satisfiability threshold conjecture S. Goldwasser Proceedings 35th Symposium on Foundations of Computer Science 1994 592 603
30. P. Kanerva Self-propagating search: A unified theory of memory 2nd ed. Technical Report CSLI-84-7 1984 Stanford University CA
31. R.M. Karp J. Pearl Searching for an optimal path in a tree with random costs Artif. Intell. 21 1983 99 116
32. S. Kirkpatrick C.D. Gelatt M.P. Vecchi Optimization by simulated annealing Science 220 1983 671 680
33. S. Kirkpatrick B. Selman Critical behavior in the satisfiability of random boolean expressions Science 264 1994 1297 1301
34. J.R. Koza 2nd ed. Genetic Programming: On Programming Computers by Means of Natural Selection and Genetics 1992 MIT Press Cambridge, MA
35. T. Larrabee Y. Tsuji Evidence for a satisfiability threshold for random 3CNF formulas H. Hirsh AAAI Spring Symposium on AI and NP-Hard Problems 1993 AAAI Menlo Park, CA
36. M. Lau T. Okagaki Applications of the phase transition theory in visual recognition and classifications J. Visual Commun. Image Representation 5 1 1994 88 94
37. G. Lewandowski A. Condon Experiments with parallel graph coloring heuristics Proceedings 2nd DIMACS Challenge 1993
38. A.K. Mackworth Constraint satisfaction S. Shapiro D. Eckroth Encyclopedia of AI 1987 Wiley New York 205 211
39. C.J.H. McDiarmid G.M.A. Provan An expected-cost analysis of backtracking and non-backtracking algorithms J. Mylopoulos R. Reiter Proceedings IJCAI-91 Sydney, Australia 1991 172 177
40. S. Minton M.D. Johnston A.B. Philips P. Laird Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems Artif. Intell. 58 1992 161 205
41. S. Minton I. Underwood Small is beautiful: a brute-force approach to learning first-order formulas Proceedings AAAI-94 Seattle, WA 1994 168 174
42. D. Mitchell B. Selman H. Levesque Hard and easy distributions of SAT problems Proceedings AAAI-92 San Jose, CA 1992 459 465
43. A. Nijenhuis H.S. Wilf 2nd ed. Combinatorial Algorithms for Computers and Calculators 1978 Academic Press New York
44. J. Pearl Heuristics: Intelligent Search Strategies for Computer Problem Solving 1984 Addison-Wesley Reading, MA
45. J. Pearl Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference 1988 Morgan Kaufmann San Mateo, CA
46. P. Prosser An empirical study of phase transitions in binary constraint satisfaction problems Technical Report AISL-49-93 1993 Department of Computer Science, University of Strathclyde Glasgow, Scotland
47. P. Prosser also Artif. Intell. 81 1996 81 109 (this volume)
48. P.W. Purdom Jr. Search rearrangement backtracking and polynomial average time Artif. Intell. 21 1983 117 133
49. B. Selman H. Levesque D. Mitchell A new method for solving hard satisfiability problems Proceedings AAAI-92 San Jose, CA 1992 440 446
50. J. Shrager T. Hogg B.A. Huberman Observation of phase transitions in spreading activation networks Science 236 1987 1092 1094
51. B.M. Smith The phase transition in constraint satisfaction problems: a closer look at the mushy region Technical Report 93.41 1994 Division of AI, University of Leeds Leeds England
52. H.S. Stone P. Sipala The average complexity of depth-first search with backtracking and cutoff IBM J. Res. Development 30 1986 242 258
53. M.S. Waterman L. Gordon R. Arratia Phase transitions in sequence matches and nucleic acid structure Proc. Nat. Acad. Sci. USA 84 1987 1239 1243
54. C.P. Williams T. Hogg Using deep structure to locate hard problems Proceedings AAAI-92 San Jose, CA 1992 472 477
55. C.P. Williams T. Hogg Extending deep structure Proceedings AAAI-93 Washington, DC 1993 152 157
56. C.P. Williams T. Hogg The typicality of phase transitions in search Comput. Intell. 9 3 1993 221 238
57. C.P. Williams T. Hogg Exploiting the deep structure of constraint problems Artif. Intell. 70 1994 73 117
58. K. Wilson Problems in physics with many scales of length Sci. American 241 August 1979 158 179
59. W. Zhang R.E. Korf An average-case analysis of branch-and-bound with applications: summary of results Proceedings AAAI-92 San Jose, CA 1992 545 550