{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:08Z","timestamp":1750306088906,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,15]],"date-time":"2017-07-15T00:00:00Z","timestamp":1500076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,15]]},"DOI":"10.1145\/3067695.3067718","type":"proceedings-article","created":{"date-parts":[[2017,7,11]],"date-time":"2017-07-11T20:17:18Z","timestamp":1499804238000},"page":"489-509","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Representations for evolutionary algorithms"],"prefix":"10.1145","author":[{"given":"Franz","family":"Rothlauf","sequence":"first","affiliation":[{"name":"Johannes Gutenberg Universit\u00e4t Mainz, Mainz\/Germany"}]}],"member":"320","published-online":{"date-parts":[[2017,7,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Piscataway","author":"B\u00e4ck T.","year":"1997","unstructured":"B\u00e4ck , T. , Michalewicz , Z. , and Yao , X. , editors ( 1997 ). Proceedings of the Fourth International Conference on Evolutionary Computation , Piscataway . IEEE Service Center . B\u00e4ck, T., Michalewicz, Z., and Yao, X., editors (1997). Proceedings of the Fourth International Conference on Evolutionary Computation, Piscataway. IEEE Service Center."},{"key":"e_1_3_2_1_2_1","volume-title":"School of Cognitive Sciences","author":"Barnett L.","year":"1997","unstructured":"Barnett , L. ( 1997 ). Tangled webs: Evolutionary dynamics on fitness landscapes with neutrality. Master's thesis , School of Cognitive Sciences , University of East Sussex , Brighton. Barnett, L. (1997). Tangled webs: Evolutionary dynamics on fitness landscapes with neutrality. Master's thesis, School of Cognitive Sciences, University of East Sussex, Brighton."},{"key":"e_1_3_2_1_3_1","first-page":"18","volume-title":"Proceedings of the 6th International Conference on Artificial Life (ALIFE-98)","author":"Barnett L.","year":"1998","unstructured":"Barnett , L. ( 1998 ). Ruggedness and neutrality: The NKp family of fitness landscapes. In Adami, C., Belew, R. K., Kitano, H., and Taylor, C. E., editors , Proceedings of the 6th International Conference on Artificial Life (ALIFE-98) , pages 18 -- 27 , Cambridge. MIT Press. Barnett, L. (1998). Ruggedness and neutrality: The NKp family of fitness landscapes. In Adami, C., Belew, R. K., Kitano, H., and Taylor, C. E., editors, Proceedings of the 6th International Conference on Artificial Life (ALIFE-98), pages 18--27, Cambridge. MIT Press."},{"key":"e_1_3_2_1_4_1","first-page":"30","volume-title":"Netcrawling - optimal evolutionary search with neutral networks. In (Kim et al","author":"Barnett L.","year":"2001","unstructured":"Barnett , L. ( 2001 ). Netcrawling - optimal evolutionary search with neutral networks. In (Kim et al ., 2001), pages 30 -- 37 . Barnett, L. (2001). Netcrawling - optimal evolutionary search with neutral networks. In (Kim et al., 2001), pages 30--37."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645513.757740"},{"key":"e_1_3_2_1_6_1","first-page":"862","volume-title":"Cant'u-Paz, E., Foster, J. A., Deb, K., Davis, D., Roy, R., O'Reilly, U.-M., Beyer, H.-G., Standish, R., Kendall, G., Wilson, S., Harman, M., Wegener, J., Dasgupta, D., Potter","author":"Choi S.-S.","year":"2003","unstructured":"Choi , S.-S. and Moon , B . -R. (2003). Normalization in genetic algorithms . In Cant'u-Paz, E., Foster, J. A., Deb, K., Davis, D., Roy, R., O'Reilly, U.-M., Beyer, H.-G., Standish, R., Kendall, G., Wilson, S., Harman, M., Wegener, J., Dasgupta, D., Potter , M. A., Schultz, A. C., Dowsland, K., Jonoska, N., and Miller, J., editors, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2003 , pages 862 -- 873 , Heidelberg. Springer . Choi, S.-S. and Moon, B.-R. (2003). Normalization in genetic algorithms. In Cant'u-Paz, E., Foster, J. A., Deb, K., Davis, D., Roy, R., O'Reilly, U.-M., Beyer, H.-G., Standish, R., Kendall, G., Wilson, S., Harman, M., Wegener, J., Dasgupta, D., Potter, M. A., Schultz, A. C., Dowsland, K., Jonoska, N., and Miller, J., editors, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2003, pages 862--873, Heidelberg. Springer."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.913699"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1988.122547"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011504414730"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/645512.657242"},{"key":"e_1_3_2_1_11_1","first-page":"1","volume-title":"On neutral networks and evolvability. In (Kim et al","author":"Ebner M.","year":"2001","unstructured":"Ebner , M. , Langguth , P. , Albert , J. , Shackleton , M. , and Shipman , R . ( 2001 ). On neutral networks and evolvability. In (Kim et al ., 2001), pages 1 -- 8 . Ebner, M., Langguth, P., Albert, J., Shackleton, M., and Shipman, R. (2001). On neutral networks and evolvability. In (Kim et al., 2001), pages 1--8."},{"key":"e_1_3_2_1_12_1","first-page":"115","volume-title":"Proceedings of the Fourth International Conference on Genetic Algorithms","author":"Eshelman L. J.","year":"1991","unstructured":"Eshelman , L. J. and Schaffer , J. D . ( 1991 ). Preventing premature convergence in genetic algorithms by preventing incest. In Belew, R. K. and Booker, L. B., editors , Proceedings of the Fourth International Conference on Genetic Algorithms , pages 115 -- 122 , Burlington. Morgan Kaufmann. Eshelman, L. J. and Schaffer, J. D. (1991). Preventing premature convergence in genetic algorithms by preventing incest. In Belew, R. K. and Booker, L. B., editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 115--122, Burlington. Morgan Kaufmann."},{"key":"e_1_3_2_1_13_1","volume-title":"An Introduction to Probability Theory and its Applications","author":"Feller W.","year":"1957","unstructured":"Feller , W. ( 1957 ). An Introduction to Probability Theory and its Applications , volume 1 . John Wiley & Sons , New York , 1 st edition. Feller, W. (1957). An Introduction to Probability Theory and its Applications, volume 1. John Wiley & Sons, New York, 1st edition.","edition":"1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0303-2647(94)90040-X"},{"key":"e_1_3_2_1_15_1","volume-title":"Piscataway","author":"Fonseca C.","year":"2000","unstructured":"Fonseca , C. , Kim , J.-H. , and Smith , A. , editors ( 2000 ). Proceedings of 2000 IEEE Congress on Evolutionary Computation , Piscataway . IEEE Press . Fonseca, C., Kim, J.-H., and Smith, A., editors (2000). Proceedings of 2000 IEEE Congress on Evolutionary Computation, Piscataway. IEEE Press."},{"key":"e_1_3_2_1_16_1","first-page":"284","volume-title":"Foundations of Genetic Algorithms","author":"Fox B. R.","year":"1991","unstructured":"Fox , B. R. and McMahon , M. B. ( 1991 ). Genetic operators for sequencing problems . In Rawlins, G. J. E., editor, Foundations of Genetic Algorithms , pages 284 -- 300 , San Mateo. Morgan Kaufmann . Fox, B. R. and McMahon, M. B. (1991). Genetic operators for sequencing problems. In Rawlins, G. J. E., editor, Foundations of Genetic Algorithms, pages 284--300, San Mateo. Morgan Kaufmann."},{"key":"e_1_3_2_1_17_1","series-title":"LNCS","first-page":"70","volume-title":"Schwefel, H.-P","author":"Gerrits M.","year":"1991","unstructured":"Gerrits , M. and Hogeweg , P . ( 1991 ). Redundant coding of an NP-complete problem allows effective genetic algorithm search . In Schwefel, H.-P . and Manner, R., editors, Parallel Problem Solving from Nature - PPSN I, volume 496 of LNCS , pages 70 -- 74 , Berlin. Springer . Gerrits, M. and Hogeweg, P. (1991). Redundant coding of an NP-complete problem allows effective genetic algorithm search. In Schwefel, H.-P. and Manner, R., editors, Parallel Problem Solving from Nature - PPSN I, volume 496 of LNCS, pages 70--74, Berlin. Springer."},{"key":"e_1_3_2_1_18_1","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"Goldberg D. E.","year":"1989","unstructured":"Goldberg , D. E. ( 1989 ). Genetic algorithms in search, optimization, and machine learning . Addison-Wesley , Reading . Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading."},{"issue":"2","key":"e_1_3_2_1_19_1","first-page":"139","article-title":"Real-coded genetic algorithms, virtual alphabets, and blocking","volume":"5","author":"Goldberg D. E.","year":"1991","unstructured":"Goldberg , D. E. ( 1991 ). Real-coded genetic algorithms, virtual alphabets, and blocking . Complex Systems , 5 ( 2 ): 139 -- 167 . Goldberg, D. E. (1991). Real-coded genetic algorithms, virtual alphabets, and blocking. Complex Systems, 5(2):139--167.","journal-title":"Complex Systems"},{"key":"e_1_3_2_1_20_1","first-page":"7","volume-title":"The gambler's ruin problem, genetic algorithms, and the sizing of populations. In (B\u00e4ck et al","author":"Harik G. R.","year":"1997","unstructured":"Harik , G. R. , Cantu-Paz , E. , Goldberg , D. E. , and Miller , B. L . ( 1997 ). The gambler's ruin problem, genetic algorithms, and the sizing of populations. In (B\u00e4ck et al ., 1997), pages 7 -- 12 . Harik, G. R., Cantu-Paz, E., Goldberg, D. E., and Miller, B. L. (1997). The gambler's ruin problem, genetic algorithms, and the sizing of populations. In (B\u00e4ck et al., 1997), pages 7--12."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.871252"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/645514.657929"},{"key":"e_1_3_2_1_23_1","first-page":"791","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO '99","author":"Julstrom B. A.","year":"1999","unstructured":"Julstrom , B. A. ( 1999 ). Redundant genetic encodings may not be harmful. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., and Smith, R. E., editors , Proceedings of the Genetic and Evolutionary Computation Conference, GECCO '99 , page 791 , Burlington. Morgan Kaufmann. Julstrom, B. A. (1999). Redundant genetic encodings may not be harmful. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., and Smith, R. E., editors, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO '99, page 791, Burlington. Morgan Kaufmann."},{"key":"e_1_3_2_1_24_1","volume-title":"Piscataway","author":"Kim J.-H.","year":"2001","unstructured":"Kim , J.-H. , Zhang , B.-T. , Fogel , G. , and Kuscu , I. , editors ( 2001 ). Proceedings of 2001 IEEE Congress on Evolutionary Computation , Piscataway . IEEE Press . Kim, J.-H., Zhang, B.-T., Fogel, G., and Kuscu, I., editors (2001). Proceedings of 2001 IEEE Congress on Evolutionary Computation, Piscataway. IEEE Press."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511623486","volume-title":"The Neutral Theory of Molecular Evolution","author":"Kimura M.","year":"1983","unstructured":"Kimura , M. ( 1983 ). The Neutral Theory of Molecular Evolution . Cambridge University Press . Kimura, M. (1983). The Neutral Theory of Molecular Evolution. Cambridge University Press."},{"key":"e_1_3_2_1_26_1","first-page":"88","volume-title":"Merelo, J. J., Adamidis, P., Beyer, H.-G., Fernandez-Villacanas, J.-L., and Schwefel, H.-P.","author":"Knowles J. D.","year":"2002","unstructured":"Knowles , J. D. and Watson , R. A . ( 2002 ). On the utility of redundant encodings in mutationbased evolutionary search . In Merelo, J. J., Adamidis, P., Beyer, H.-G., Fernandez-Villacanas, J.-L., and Schwefel, H.-P. , editors, Parallel Problem Solving from Nature-PPSN VII, pages 88 -- 98 , Berlin. Springer . Knowles, J. D. and Watson, R. A. (2002). On the utility of redundant encodings in mutationbased evolutionary search. In Merelo, J. J., Adamidis, P., Beyer, H.-G., Fernandez-Villacanas, J.-L., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature-PPSN VII, pages 88--98, Berlin. Springer."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/09528139008953717"},{"key":"e_1_3_2_1_28_1","volume-title":"Deb, K., Poli, R., Banzhaf, W., Beyer, H.-G., Burke, E., Darwen, P., Dasgupta, D., Floreano, D., Foster, J., Harman, M., Holland, O., Lanzi","author":"Moraglio A.","year":"2004","unstructured":"Moraglio , A. and Poli , R . ( 2004 ). Topological interpretation of crossover . In Deb, K., Poli, R., Banzhaf, W., Beyer, H.-G., Burke, E., Darwen, P., Dasgupta, D., Floreano, D., Foster, J., Harman, M., Holland, O., Lanzi , P. L., Spector, L., Tettamanzi, A., Thierens, D., and Tyrrell, A., editors, gecco2004, pages 1377--1388, Heidelberg. Springer. Moraglio, A. and Poli, R. (2004). Topological interpretation of crossover. In Deb, K., Poli, R., Banzhaf, W., Beyer, H.-G., Burke, E., Darwen, P., Dasgupta, D., Floreano, D., Foster, J., Harman, M., Holland, O., Lanzi, P. L., Spector, L., Tettamanzi, A., Thierens, D., and Tyrrell, A., editors, gecco2004, pages 1377--1388, Heidelberg. Springer."},{"key":"e_1_3_2_1_30_1","first-page":"259","volume-title":"Parallel Problem Solving from Nature - PPSN II","author":"Radcliffe N. J.","year":"1992","unstructured":"Radcliffe , N. J. ( 1992 ). Non-linear genetic representations . In Manner, R. and Manderick, B., editors, Parallel Problem Solving from Nature - PPSN II , pages 259 -- 268 , Berlin. Springer . Radcliffe, N. J. (1992). Non-linear genetic representations. In Manner, R. and Manderick, B., editors, Parallel Problem Solving from Nature - PPSN II, pages 259--268, Berlin. Springer."},{"key":"e_1_3_2_1_31_1","volume-title":"Handbook of Evolutionary Computation","author":"Radcliffe N. J.","year":"1997","unstructured":"Radcliffe , N. J. ( 1997 ). Theoretical foundations and properties of evolutionary computations: Schema processing . In B\u00e4ck, T., Fogel, D. B., and Michalewicz, Z., editors, Handbook of Evolutionary Computation , pages B2.5:1--B2.5:10. Institute of Physics Publishing and Oxford University Press , Bristol and New York. Radcliffe, N. J. (1997). Theoretical foundations and properties of evolutionary computations: Schema processing. In B\u00e4ck, T., Fogel, D. B., and Michalewicz, Z., editors, Handbook of Evolutionary Computation, pages B2.5:1--B2.5:10. Institute of Physics Publishing and Oxford University Press, Bristol and New York."},{"key":"e_1_3_2_1_32_1","first-page":"43","volume-title":"An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. In (Fonseca et al","author":"Raidl G. R.","year":"2000","unstructured":"Raidl , G. R. ( 2000 ). An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. In (Fonseca et al ., 2000), pages 43 -- 48 . Raidl, G. R. (2000). An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. In (Fonseca et al., 2000), pages 43--48."},{"key":"e_1_3_2_1_33_1","volume-title":"Fitness landscapes: A guided tour. Joint tutorials of SAB 2000 and PPSN","author":"Reeves C. R.","year":"2000","unstructured":"Reeves , C. R. ( 2000 ). Fitness landscapes: A guided tour. Joint tutorials of SAB 2000 and PPSN 2000, tutorial handbook. Reeves, C. R. (2000). Fitness landscapes: A guided tour. Joint tutorials of SAB 2000 and PPSN 2000, tutorial handbook."},{"key":"e_1_3_2_1_34_1","first-page":"43","volume-title":"Robust encodings in genetic algorithms: A survey of encoding issues. In (B\u00e4ck et al","author":"Ronald S.","year":"1997","unstructured":"Ronald , S. ( 1997 ). Robust encodings in genetic algorithms: A survey of encoding issues. In (B\u00e4ck et al ., 1997), pages 43 -- 48 . Ronald, S. (1997). Robust encodings in genetic algorithms: A survey of encoding issues. In (B\u00e4ck et al., 1997), pages 43--48."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1995.487457"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-88094-0","volume-title":"Representations for Genetic and Evolutionary Algorithms. Number 104 in Studies on Fuzziness and Soft Computing","author":"Rothlauf F.","year":"2002","unstructured":"Rothlauf , F. ( 2002 ). Representations for Genetic and Evolutionary Algorithms. Number 104 in Studies on Fuzziness and Soft Computing . Springer , Heidelberg , 1 st edition. Rothlauf, F. (2002). Representations for Genetic and Evolutionary Algorithms. Number 104 in Studies on Fuzziness and Soft Computing. Springer, Heidelberg, 1st edition.","edition":"1"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365603322519288"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00007"},{"key":"e_1_3_2_1_39_1","first-page":"493","volume-title":"An investigation of redundant genotypephenotype mappings and their role in evolutionary search. In (Fonseca et al","author":"Shackleton M.","year":"2000","unstructured":"Shackleton , M. , Shipman , R. , and Ebner , M . ( 2000 ). An investigation of redundant genotypephenotype mappings and their role in evolutionary search. In (Fonseca et al ., 2000), pages 493 -- 500 . Shackleton, M., Shipman, R., and Ebner, M. (2000). An investigation of redundant genotypephenotype mappings and their role in evolutionary search. In (Fonseca et al., 2000), pages 493--500."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6384-9_57"},{"key":"e_1_3_2_1_41_1","volume-title":"Proceedings of Artificial Life VII, page section III (Evolutionary and Adaptive Dynamics)","author":"Shipman R.","year":"2000","unstructured":"Shipman , R. , Shackleton , M. , Ebner , M. , and Watson , R . ( 2000 a). Neutral search spaces for artificial evolution: A lesson from life . In Bedau, M., McCaskill, J., Packard, N., and Rasmussen, S., editors, Proceedings of Artificial Life VII, page section III (Evolutionary and Adaptive Dynamics) . MIT Press . Shipman, R., Shackleton, M., Ebner, M., and Watson, R. (2000a). Neutral search spaces for artificial evolution: A lesson from life. In Bedau, M., McCaskill, J., Packard, N., and Rasmussen, S., editors, Proceedings of Artificial Life VII, page section III (Evolutionary and Adaptive Dynamics). MIT Press."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026714927227"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/645302.648788"},{"key":"e_1_3_2_1_45_1","first-page":"136","volume-title":"Neutral networks in an evolutionary robotics search space. In (Kim et al","author":"Smith T.","year":"2001","unstructured":"Smith , T. , Husbands , P. , and O'Shea , M. ( 2001 c). Neutral networks in an evolutionary robotics search space. In (Kim et al ., 2001), pages 136 -- 145 . Smith, T., Husbands, P., and O'Shea, M. (2001c). Neutral networks in an evolutionary robotics search space. In (Kim et al., 2001), pages 136--145."},{"key":"e_1_3_2_1_46_1","first-page":"366","volume-title":"Voigt, H.-M., Ebeling, W., Rechenberg, I., and Schwefel, H.-P.","author":"Surry P. D.","year":"1996","unstructured":"Surry , P. D. and Radcliffe , N . ( 1996 ). Formal algorithms + formal representations = search strategies . In Voigt, H.-M., Ebeling, W., Rechenberg, I., and Schwefel, H.-P. , editors, Parallel Problem Solving from Nature - PPSN IV, pages 366 -- 375 , Berlin. Springer . Surry, P. D. and Radcliffe, N. (1996). Formal algorithms + formal representations = search strategies. In Voigt, H.-M., Ebeling, W., Rechenberg, I., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature - PPSN IV, pages 366--375, Berlin. Springer."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45823-6_27"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10762-2_46"},{"key":"e_1_3_2_1_49_1","first-page":"1354","volume-title":"Proceedings of 2002 IEEE Congress on Evolutionary Computation","author":"Toussaint M.","year":"2002","unstructured":"Toussaint , M. and Igel , C . ( 2002 ). Neutrality: A necessity for self-adaptation. In Fogel, D. B., El-Sharkawi, M. A., Yao, X., Greenwood, G., Iba, H., Marrow, P., and Shackleton, M., editors , Proceedings of 2002 IEEE Congress on Evolutionary Computation , pages 1354 -- 1359 , Piscataway. IEEE Press. Toussaint, M. and Igel, C. (2002). Neutrality: A necessity for self-adaptation. In Fogel, D. B., El-Sharkawi, M. A., Yao, X., Greenwood, G., Iba, H., Marrow, P., and Shackleton, M., editors, Proceedings of 2002 IEEE Congress on Evolutionary Computation, pages 1354--1359, Piscataway. IEEE Press."},{"key":"e_1_3_2_1_50_1","series-title":"LNCS","first-page":"97","volume-title":"Eiben, A. E., Back, T., Schoenauer, M., and Schwefel, H.-P.","author":"Watson R. A.","year":"1998","unstructured":"Watson , R. A. , Hornby , G. S. , and Pollack , J. B . ( 1998 ). Modeling building-block interdependency . In Eiben, A. E., Back, T., Schoenauer, M., and Schwefel, H.-P. , editors, Parallel Problem Solving from Nature - PPSN V, volume 1498 of LNCS , pages 97 -- 106 , Berlin. Springer . Watson, R. A., Hornby, G. S., and Pollack, J. B. (1998). Modeling building-block interdependency. In Eiben, A. E., Back, T., Schoenauer, M., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature - PPSN V, volume 1498 of LNCS, pages 97--106, Berlin. Springer."},{"key":"e_1_3_2_1_51_1","volume-title":"Joint Tutorials of SAB 2000 and PPSN 2000.","author":"Whitley L. D.","year":"2000","unstructured":"Whitley , L. D. ( 2000 ). Walsh analysis, schemata, embedded landscapes and no free lunch . Joint Tutorials of SAB 2000 and PPSN 2000. Whitley, L. D. (2000). Walsh analysis, schemata, embedded landscapes and no free lunch. Joint Tutorials of SAB 2000 and PPSN 2000."},{"key":"e_1_3_2_1_52_1","series-title":"LNCS","first-page":"204","volume-title":"Proceedings of the Fourth European Conference on Genetic Programming (EuroGP-2001)","author":"Yu T.","year":"2001","unstructured":"Yu , T. and Miller , J . ( 2001 ). Neutrality and evolvability of Boolean function landscapes . In Miller, J., Tomassini, M., Lanzi, P. L., Ryan, C., Tetamanzi, A. G. B., and Langdon, W. B., editors, Proceedings of the Fourth European Conference on Genetic Programming (EuroGP-2001) , volume 2038 of LNCS , pages 204 -- 217 , Berlin. Springer . Yu, T. and Miller, J. (2001). Neutrality and evolvability of Boolean function landscapes. In Miller, J., Tomassini, M., Lanzi, P. L., Ryan, C., Tetamanzi, A. G. B., and Langdon, W. B., editors, Proceedings of the Fourth European Conference on Genetic Programming (EuroGP-2001), volume 2038 of LNCS, pages 204--217, Berlin. Springer."},{"key":"e_1_3_2_1_53_1","series-title":"LNCS","first-page":"13","volume-title":"Proceedings of the Fifth European Conference on Genetic Programming (EuroGP-2002)","author":"Yu T.","year":"2002","unstructured":"Yu , T. and Miller , J . ( 2002 ). Finding needles in haystacks is not hard with neutrality . In Foster, J. A., Lutton, E., Miller, J., Ryan, C., and Tettamanzi, A. G. B., editors, Proceedings of the Fifth European Conference on Genetic Programming (EuroGP-2002) , volume 2278 of LNCS , pages 13 -- 25 , Berlin. Springer . Yu, T. and Miller, J. (2002). Finding needles in haystacks is not hard with neutrality. In Foster, J. A., Lutton, E., Miller, J., Ryan, C., and Tettamanzi, A. G. B., editors, Proceedings of the Fifth European Conference on Genetic Programming (EuroGP-2002), volume 2278 of LNCS, pages 13--25, Berlin. Springer."}],"event":{"name":"GECCO '17: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Berlin Germany","acronym":"GECCO '17"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3067695.3067718","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3067695.3067718","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:19Z","timestamp":1750217419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3067695.3067718"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,15]]},"references-count":51,"alternative-id":["10.1145\/3067695.3067718","10.1145\/3067695"],"URL":"https:\/\/doi.org\/10.1145\/3067695.3067718","relation":{},"subject":[],"published":{"date-parts":[[2017,7,15]]},"assertion":[{"value":"2017-07-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}