Measuring the spatial dispersion of evolutionary search processes: Application to walksat

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

Volumn 2310, Issue , 2002, Pages 77-87

  Sidaner, Alain ^a   Bailleux, Olivier ^b   Chabrier, Jean Jacques ^a  

^a UNIVERSITÉ DE BOURGOGNE   (France)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS;

EVOLUTIONARY SEARCH; INTENSIFICATION AND DIVERSIFICATIONS; LOCAL SEARCH; METRIC SPACES; POPULATION DIVERSITY; SEARCH SPACES; SPATIAL DISPERSION; TIME INTERVAL;

DISPERSIONS;

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

References (15)

1. Barker A.L., Martin W.N.: Dynamics of a Distance Based Population Diversity Measure. Congress on Evolutionary Computation, IEEE Press, 2000.
2. Chvátal V., Szemerédi E.: Many hard examples for Resolution. In Journal of the ACM, pages 759-768, 1988.
3. Cook S.A.: The complexity of theorem proving procedures. In Conference Records of Third Annual ACM Symposium on Theory of Computing, pages 151-158, 1971.
4. Dubois O., Andre P., Boufkhad Y., Carlier J.: SAT versus UNSAT. In Clique, Coloring and Satisfiability: Second DIMACS implementation challenge, Volume 26 of DIMACS series in Discrete Mathematics and Computer Science, pages 415- 136, American Mathematical Society, 1996.
5. Frank J., Cheeseman P., Stutz, J. (to appear): When gravity fails: local search topology. Gupta and Nau (1992). On the complexity of blocks-world planning. Artificial Intelligence (1997) 56, 139–403
6. Goldberg D.E., Richardson J.J.: Genetic algorithms with sharing for multimodal function optimization. Gen. Algs. and their Apps.: Proc. 2nd Intl. Conf. Gen. Algs., Cambridge, MA, July 1987, 28–31 (Lawrence Erlbaum).
7. Jones T., Forest S.: Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms. In Proceedings of the 6th International Conference on Genetic Algorithms (1995) 184-192.
8. Mauldin M.L.: Maintaining diversity in genetic search. In Proceedings of the National Conference on AI (1984) 247–250. AAAI.
9. McAllester D., Selman B., Kautz H.: Evidence for Invariants in Local Search. In Proceedings of AAAI-97 (1997) 321-326.
10. Michalewicz Z.: Genetic algorithms + Data Structures = Evolution Programs. Artificial Intelligence, Springer Verlag. New York, 1992.
11. Miller B.L., Shaw M.J.: Genetic Algorithms with Dynamic Niche Sharing for Multimodal Function Optimization. IEEE International Conference on Evolutionary Computation, pp 786-791, Piscataway, NJ: IEEE Press 1995.
12. Schuurmans D., Southey F.: Local search characteristics of incomplete SAT procedures. In Proceedings of the Seventeenth National Conference on Articial Intelligence (AAAI-2000), pages 297-302, 2000.
13. Sefrioui M., Périaux J.: Fast convergence thanks to diversity. In Proc. of the Fifth Annual Conference on Evolutionary Programming (1996) 313-321
14. Selman B., Kautz H., Cohen, B.: Noise Strategies for Local Search. In Proceedings of AAAI-94 (1994) 337-343.
15. Sidaner A., Chabrier J.-J., Bailleux O.: Towards a quantification of attraction in stochastic local search. Proc. of the Workshop on Empirical Methods in Artificial Intelligence at ECAI’00, Berlin, Germany, pp 39-41, August 2000