{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T12:43:40Z","timestamp":1751287420444},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_10","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T05:45:28Z","timestamp":1180676728000},"page":"117-127","source":"Crossref","is-referenced-by-count":5,"title":["The Effects of Partial Restarts in Evolutionary Search"],"prefix":"10.1007","author":[{"given":"Ingo la","family":"Tendresse","sequence":"first","affiliation":[]},{"given":"Jens","family":"Gottlieb","sequence":"additional","affiliation":[]},{"given":"Odej","family":"Kao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,10]]},"reference":[{"key":"10_CR1","series-title":"Lect Notes Comput Sci","first-page":"125","volume-title":"A Superior Evolutionary Algorithm for 3-SAT","author":"T. B\u00e4ck","year":"1998","unstructured":"T. B\u00e4ck, A. E. Eiben, and M. E. Vink. A Superior Evolutionary Algorithm for 3-SAT. In Proceedings of the 7th Annual Conference on Evolutionary Programming, Lecture Notes in Computer Science, Volume 1477, 125\u2013136, Springer, 1998"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"T. B\u00e4ck, D.B. Fogel, and Z. Michalewicz (eds.): Handbook of Evolutionary Computation, Oxford University Press, 1997","DOI":"10.1887\/0750308958"},{"key":"10_CR3","unstructured":"L.J. Eshelman, J.D. Schaffer: Preventing Premature Convergence in Genetic Algorithms by Preventing Incest, Proceedings of the Fourth International Conference on Genetic Algorithms, 115\u2013122, 1991"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"L. Eshelman, The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination, In G. Rawlins, editor, FOGA\u20141, pages 265\u2013283. Morgan Kaufmann, 1991","DOI":"10.1016\/B978-0-08-050684-5.50020-3"},{"key":"10_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, CA, 1979"},{"key":"10_CR6","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D. E. Goldberg","year":"1989","unstructured":"D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989"},{"key":"10_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1007\/3-540-45356-3_61","volume-title":"Adaptive Fitness Functions for the Satisfiability Problem","author":"J. Gottlieb","year":"2000","unstructured":"J. Gottlieb and N. Voss. Adaptive Fitness Functions for the Satisfiability Problem. In Proceedings of the 6th International Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Volume 1917, 621\u2013630, Springer, 2000"},{"key":"10_CR8","unstructured":"H. H. Hoos. Stochastic Local Search\u2014 Methods, Models, Applications. Dissertation, Darmstadt University of Technology, 1998"},{"key":"10_CR9","unstructured":"S. W. Mahfoud. Crowding and Preselection Revisited. In Proceedings of the 2nd Conference on Parallel Problem Solving From Nature, North-Holland, 27\u201336, 1992"},{"key":"10_CR10","unstructured":"J. Maresky, Y. Davidor, D. Gitler, G. Aharoni, A. Barak. Selectively Destructive Re-start. In Proceedings of the Sixth International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 144\u2013150, 1995"},{"key":"10_CR11","unstructured":"E. Marchiori and C. Rossi. A Flipping Genetic Algorithm for Hard 3-SAT Problems. In Proceedings of the Genetic and Evolutionary Computation Conference, 393\u2013400, Morgan Kaufmann, 1999"},{"key":"10_CR12","unstructured":"D. Mitchell, B. Selman, and H. Levesque. Hard and Easy Distributions of SAT Problems. In Proceedings of the 10th National Conference on Artificial Intelligence, 459\u2013465, 1992"},{"key":"10_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/10721187_1","volume-title":"Fitness Landscapes and Evolutionary Algorithms","author":"C. R. Reeves","year":"2000","unstructured":"C. R. Reeves. Fitness Landscapes and Evolutionary Algorithms. In Proceedings of Artificial Evolution, Lecture Notes in Computer Science, Volume 1829, 3\u201320, Springer, 2000"},{"key":"10_CR14","unstructured":"G. R. Raidl and J. Gottlieb. On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms. In Late-Breaking Papers at the Genetic and Evolutionary Computation Conference, 204\u2013211, 1999"},{"key":"10_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1007\/BFb0056920","volume-title":"Genetic Algorithm Behavior in the MAXSAT Domain","author":"S. Rana","year":"1998","unstructured":"S. Rana and D. Whitley. Genetic Algorithm Behavior in the MAXSAT Domain. In Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Volume 1498, 785\u2013794, Springer, 1998"},{"key":"10_CR16","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1613\/jair.711","volume":"12","author":"J. Singer","year":"2000","unstructured":"J. Singer, I. P. Gent, and A. Smaill. Backbone Fragility and the Local Search Cost Peak. Journal of Artificial Intelligence Research. Volume 12, 235\u2013270, 2000","journal-title":"Journal of Artificial Intelligence Research"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T02:21:15Z","timestamp":1550370075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46033-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540435440","9783540460336"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-46033-0_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}