Sat, local search dynamics and density of states

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

Volumn 2310, Issue , 2002, Pages 192-204

  Bélaidouni, Mériéma ^a   Hao, Jin Kao ^a  

^a UNIVERSITÉ D'ANGERS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DENSITY OF STATE; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; NORMAL LAW; NP COMPLETE; SAT PROBLEMS; SEARCH SPACES;

LOCAL SEARCH (OPTIMIZATION);

EID: 84959043517     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46033-0_16     Document Type: Conference Paper

References (23)

1. E. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines. John Wiley and Sons, 1989.
2. E. Angel and V. Zissimopoulos. Autocorrelation Coefficient for Graph Bipartitioning Problem. Theo. Computer Sience, 91: 229–243, 1998.
3. M. Belaidouni and J. K. Hao. An Analysis of the Configuration Space of the Maximal Constraint Satisfaction Problem. Proc. of PPSN VI, LNCS 1917: 49–58, 2000.
4. J. Bresina, M. Drummond and K. Swanson. Search Space Characterization for Telescope Scheduling Application. Proc. of AAAI, 1994.
5. D. A. Clark, J. Frank, I.P Gent, E. MacInttyre, N. Tomov and T. Walsh. Local Search and the Number of Solutions, Proc. of CP, 119–133 1996.
6. J. Cupal, I. L. Hofacker and P. F. Stadler. Dynamic Programming Algorithm for the Density of States of RNA Secondar Structures. Computer Sciences and Biology, 184–186, 1996.
7. S. A. Cook. The Complexity of Theorem proving procedures. Proc. of ACM Symp. Theo. Comput., 151–158, 1971.
8. J. Cupal, C. Flamm, A. Renner and P.F. Stadler. Density of States, Metastable States and Saddle Points Exploring the Energy Landscape of an RNA molecule. Proc. Int. Conf. Int. Sys. Mol. Biol., 88–91, 1997.
9. J. Frank, P. Cheeseman, and J. Stutz. When Gravity Fails: Local Search Topology. (Electronic) Journal of Artificial Intelligence Research., 7: 249–281, 1997.
10. H. H. Hoos and T. Stutzle Proc. of SAT, IOS Press., 283–292, 2000.
11. S.A. Kauffman. Adaptation on Rugged Fitness Landscapes, Lectures in the Sciences of Complexity SFI Studies in the Sciences of Complexity, ed. D. Stein, Addison-Wesley Longman, 527–618, 1989.
12. S. Kirkpatrick and G. Toulouse. Configuration Space Analysis of Travelling Salesman Problem. J. Physics, 46: 1277–1292, 1985.
13. B. Manderick, B. de Weger, and P. Spiessens. The Genetic Algorithm and the Structure of the Fitness Landscape. Proc. of ICGA, 143–150, 1991.
14. D. McAllester, B. Selman and H. Kautz. Evidence for Invariants in Local Search. Proc. of AAAI, 321–326, 1997.
15. N. Metropolis, A.W. Rosenbluth, M.N Rosenbluth and A.H. Teller. Equation of State Calculations by Fast Computing Machines. Journal of Chemical Physics, 21: 1087–1092, 1953.
16. H. Rosé, W. Ebeling and T. Asselmeyer. Density of States-a Measure of the Difficulty of Optimization Problems. Proc. of PPSN IV, LNCS 1141: 208–226, 1996.
17. G.R. Schreiber and O.C. Martin. Procedure for Ranking Heuristics Applied to Graph Partitionning. Proc. of MIC, July 1997.
18. B. Selman, H.A. Kautz. An Empirical Study of Greedy Local Search for Satisfiability Testing. Proc. of AAAI, 1993.
19. B. Selman, H.A. Kautz and B. Cohen. Noise Strategies for Improving Local Search. Proc. of AAAI, 1994.
20. J. Singer, I. P. Gent and A. Smaill. Backbone Fragility and Local Search Cost Peak. Journal of Artificial Intelligence Research, 235–270, May 2000.
21. G. Verfaillé. CSP Aléatoires: Estimation de l’Optimum, Research Notes, 1998.
22. E. Weinberger. Correlated and Uncorrelated Fitness Landscape and How to Tell the Difference. J. Biol. Cybern., 63: 325–336, 1990.
23. M. Yokoo. Why Adding More Constraints Makes a Problem Easier for Hill-Climbing Algorithms: Analyzing Landscapes of CSPs. Proc. of CP, LNCS 1330: 357–370, 1997.