{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:48:51Z","timestamp":1725511731109},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441397"},{"type":"electronic","value":"9783540457121"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45712-7_9","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T16:28:06Z","timestamp":1210091286000},"page":"88-98","source":"Crossref","is-referenced-by-count":19,"title":["On the Utility of Redundant Encodings in Mutation-Based Evolutionary Search"],"prefix":"10.1007","author":[{"given":"Joshua D.","family":"Knowles","sequence":"first","affiliation":[]},{"given":"Richard A.","family":"Watson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"L. Barnett. Netcrawling\u2014optimal evolutionary search with neutral networks. In Proceedings of the 2001 Congress on Evolutionary Computation (CEC2001). IEEE Service Centre, Piscataway NJ, 2001.","DOI":"10.1109\/CEC.2001.934367"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"S. Bornholdt and K. Sneppen. Robustness as an evolutionary principle. Proceedings of the Royal Society of London Series B-Biological Sciences, 267:2281\u20132286, 2000.","DOI":"10.1098\/rspb.2000.1280"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"S. Bullock. Smooth operator? Understanding and visualising mutation bias. In J. Kelemen and P. Sosik, editors, Sixth European Conference on Artificial Life, pages 602\u2013612, 2001.","DOI":"10.1007\/3-540-44811-X_68"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"M. Ebner, M. Shackleton, and R. Shipman. How neutral networks influence evolvability. Complexity, 2002. (In press).","DOI":"10.1002\/cplx.10021"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"I. Harvey and A. Thompson. Through the labyrinth evolution finds a way: A silicon ridge. In Proceedings of ICES96, pages 406\u2013422. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-63173-9_62"},{"key":"9_CR6","first-page":"527","volume-title":"Lectures in the Sciences of Complexity","author":"S. A. Kauffman","year":"1989","unstructured":"S. A. Kauffman. Adaptation on rugged fitness landscapes. In D. Stein, editor, Lectures in the Sciences of Complexity, pages 527\u2013618. Redwood City: Addison-Wesley, 1989. SFI Studies in the Sciences of Complexity, Lecture Volume I."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"M. Kimura. The Neutral Theory of Molecular Evolution. Cambridge University Press, 1983.","DOI":"10.1017\/CBO9780511623486"},{"key":"9_CR8","unstructured":"M. Motoki and R. Uehara. Unique solution instance generation for the 3-satisfiability (3-SAT) problem. Technical Report C-129, Dept. of Math and Comp. Sciences, Tokyo Institute of Technology, 1999."},{"key":"9_CR9","unstructured":"M. A. Potter. An NK-landscape generator, 1997. Presented at the Workshop on Test Problem Generators for Evolutionary Algorithms, at the 7th ICGA."},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0096-3003(99)00166-6","volume":"117","author":"C. M. Reidys","year":"1998","unstructured":"C. M. Reidys and P. F. Stadler. Neutrality in fitness landscapes. Appl. Math. Comput., 117:321\u2013350, 1998.","journal-title":"Appl. Math. Comput."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"M. Shackleton, R. Shipman, and M. Ebner. An investigation of redundant genotype-phenotype mappings and their role in evolutionary search. In Proceedings of the 2000 Congress on Evolutionary Computation, pages 493\u2013500, Piscataway, NJ, 2000. IEEE Service Center.","DOI":"10.1109\/CEC.2000.870337"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"R. Shipman. Genetic redundancy: Desirable or problematic for evolutionary adaptation? In Proceedings of the 4th International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA). Springer-Verlag, 1999.","DOI":"10.1007\/978-3-7091-6384-9_57"},{"key":"9_CR13","unstructured":"R. Shipman, M. Shackleton, M. Ebner, and R. Watson. Neutral search spaces for artificial evolution: a lesson from life. In Artificial Life VII: Proceedings of the Seventh International Conference. MIT Press, 2000."},{"issue":"5","key":"9_CR14","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1006\/bulm.2000.0180","volume":"62","author":"E. Nimwegen van","year":"2000","unstructured":"E. van Nimwegen and J. P. Crutchfield. Metastable evolutionary dynamics: Crossing fitness barriers or escaping via neutral paths? Bulletin of Mathematical Biology,62(5):799\u2013848, Sep 2000.","journal-title":"Bulletin of Mathematical Biology"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"V. K. Vassilev and J. F. Miller. The advantages of landscape neutrality in digital circuit evolution. In ICES, pages 252\u2013263, 2000.","DOI":"10.1007\/3-540-46406-9_25"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"R. A. Watson. Analysis of recombinative algorithms on a non-separable buildingblock problem. In Foundations of Genetic Algorithms VI, pages 69\u201389. Morgan Kaufmann, 2001.","DOI":"10.1016\/B978-155860734-7\/50087-1"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"R. A. Watson, G. S. Hornby, and J. B. Pollack. Modeling building-block interdependency. In Parallel Problem Solving from Nature\u2014 PPSN V, pages 97\u2013106. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0056853"},{"key":"9_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44674-5","volume-title":"Neutrality and the evolvability of Boolean function landscape","author":"T. Yu","year":"2001","unstructured":"T. Yu and J. Miller. Neutrality and the evolvability of Boolean function landscape. In Proceedings of the 4th European Conference on Genetic Programming (EuroGP), volume LNCS 2038, page 204 ff. Springer-Verlag, 2001."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN VII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45712-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T00:35:20Z","timestamp":1557534920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45712-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441397","9783540457121"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45712-7_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}