{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T21:40:14Z","timestamp":1737063614813,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540435440"},{"type":"electronic","value":"9783540460336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46033-0_7","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T05:45:28Z","timestamp":1180676728000},"page":"77-87","source":"Crossref","is-referenced-by-count":1,"title":["Measuring the Spatial Dispersion of Evolutionary Search Processes: Application to Walksat"],"prefix":"10.1007","author":[{"given":"Alain","family":"Sidaner","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Bailleux","sequence":"additional","affiliation":[]},{"given":"Jean-Jacques","family":"Chabrier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,10]]},"reference":[{"key":"7_CR1","unstructured":"Barker A.L., Martin W.N.: Dynamics of a Distance Based Population Diversity Measure. Congress on Evolutionary Computation, IEEE Press, 2000."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal V., Szemer\u00e9di E.: Many hard examples for Resolution. In Journal of the ACM, pages 759\u2013768, 1988.","DOI":"10.1145\/48014.48016"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Cook S.A.: The complexity of theorem proving procedures. In Conference Records of Third Annual ACM Symposium on Theory of Computing, pages 151\u2013158, 1971.","DOI":"10.1145\/800157.805047"},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1090\/dimacs\/026\/20","volume":"26","author":"O. Dubois","year":"1996","unstructured":"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\u2013136, American Mathematical Society, 1996.","journal-title":"Clique, Coloring and Satisfiability: Second DIMACS implementation challenge"},{"key":"7_CR5","first-page":"139","volume":"56","author":"J. Frank","year":"1997","unstructured":"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\u2013403","journal-title":"On the complexity of blocks-world planning. Artificial Intelligence"},{"key":"7_CR6","unstructured":"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\u201331 (Lawrence Erlbaum)."},{"key":"7_CR7","unstructured":"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\u2013192."},{"key":"7_CR8","unstructured":"Mauldin M.L.: Maintaining diversity in genetic search. In Proceedings of the National Conference on AI (1984) 247\u2013250. AAAI."},{"key":"7_CR9","unstructured":"McAllester D., Selman B., Kautz H.: Evidence for Invariants in Local Search. In Proceedings of AAAI-97 (1997) 321\u2013326."},{"key":"7_CR10","volume-title":"Artificial Intelligence","author":"Z. Michalewicz","year":"1992","unstructured":"Michalewicz Z.: Genetic algorithms + Data Structures = Evolution Programs. Artificial Intelligence, Springer Verlag. New York, 1992."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Miller B.L., Shaw M.J.: Genetic Algorithms with Dynamic Niche Sharing for Multimodal Function Optimization. IEEE International Conference on Evolutionary Computation, pp786\u2013791, Piscataway, NJ: IEEE Press 1995.","DOI":"10.1109\/ICEC.1996.542701"},{"key":"7_CR12","unstructured":"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\u2013302, 2000."},{"key":"7_CR13","unstructured":"Sefrioui M., P\u00e9riaux J.: Fast convergence thanks to diversity. In Proc. of the Fifth Annual Conference on Evolutionary Programming (1996) 313\u2013321"},{"key":"7_CR14","unstructured":"Selman B., Kautz H., Cohen, B.: Noise Strategies for Local Search. In Proceedings of AAAI-94 (1994) 337\u2013343."},{"key":"7_CR15","unstructured":"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\u201900, Berlin, Germany, pp 39\u201341, August 2000."}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46033-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T21:05:53Z","timestamp":1737061553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46033-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540435440","9783540460336"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46033-0_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}