{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:07:03Z","timestamp":1725566823357},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540272373"},{"type":"electronic","value":"9783540320357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11513575_5","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T18:44:24Z","timestamp":1285440264000},"page":"75-94","source":"Crossref","is-referenced-by-count":9,"title":["Compact Genetic Codes as a Search Strategy of Evolutionary Processes"],"prefix":"10.1007","author":[{"given":"Marc","family":"Toussaint","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1109\/18.930911","volume":"47","author":"S. Amari","year":"2001","unstructured":"Amari, S.: Information geometry on hierarchy of probability distributions. IEEE Transactions on Information Theory\u00a047(5), 1701\u20131711 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR2","unstructured":"Baluja, S.: Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163, Comp. Sci. Dep., Carnegie Mellon U. (1994)"},{"key":"5_CR3","unstructured":"Baluja, S., Davies, S.: Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. In: Proc. of Fourteenth Int. Conf. on Machine Learning (ICML 1997), pp. 30\u201338 (1997)"},{"key":"5_CR4","unstructured":"Barbulescu, L., Watson, J.-P., Whitley, D.: Dynamic representations and escaping local optima: Improving genetic algorithms and local search. In: Seventeenth National Conference on Artificial Intelligence (AAAI), pp. 879\u2013884 (2000)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1109\/18.720554","volume":"44","author":"A. Barron","year":"1998","unstructured":"Barron, A., Rissanen, J., Yu, B.: The minimum description length principle in coding and modeling. IEEE Transactions on Information Theory\u00a044, 2743\u20132760 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR6","first-page":"424","volume-title":"Advances in Neural Information Processing Systems","author":"J.S. Bonet de","year":"1997","unstructured":"de Bonet, J.S., Isbell Jr., C.L., Viola, P.: MIMIC: Finding optima by estimating probability densities. In: Mozer, M.C., Jordan, M.I., Petsche, T. (eds.) Advances in Neural Information Processing Systems, vol.\u00a09, p. 424. The MIT Press, Cambridge (1997)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"E.D. Jong de","year":"2003","unstructured":"de Jong, E.D.: Representation development from Pareto-Coevolution. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02724, Springer, Heidelberg (2003)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"1788","DOI":"10.1126\/science.7892602","volume":"267","author":"G. Halder","year":"1995","unstructured":"Halder, G., Callaerts, P., Gehring, W.: Induction of ectopic eyes by targeted expression of the eyeless gene in Drosophila. Science\u00a0267, 1788\u20131792 (1995)","journal-title":"Science"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N. Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaption in evolutionary strategies. Evolutionary Computation\u00a09, 159\u2013195 (2001)","journal-title":"Evolutionary Computation"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Heckendorn, R.B., Wright, A.H.: Efficient linkage discovery by limited probing. Evolutionary Computation (2004) (accepted for publication)","DOI":"10.1162\/1063656043138914"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/CEC.2001.934446","volume-title":"Proc. of 2001 Congress on Evolutionary Computation (CEC 2001)","author":"G.S. Hornby","year":"2001","unstructured":"Hornby, G.S., Pollack, J.B.: The advantages of generative grammatical encodings for physical design. In: Proc. of 2001 Congress on Evolutionary Computation (CEC 2001), pp. 600\u2013607. IEEE Press, Los Alamitos (2001)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Liepins, G.E., Vose, M.D.: Representation issues in Genetic Algorithms. Journal of Experimental and Theoretical Artificial Intelligence\u00a02 (1990)","DOI":"10.1080\/09528139008953717"},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.374","volume":"7","author":"C.G. Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C.G., Witten, I.H.: Identifying hierarchical structure in sequences: A linear-time algorithm. Journal of Artificial Intelligence Research\u00a07, 67\u201382 (1997)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5_CR14","first-page":"310","volume-title":"Genetic Algorithms: Proc. of Sixth International Conf. (ICGA 1995)","author":"P. Nordin","year":"1995","unstructured":"Nordin, P., Banzhaf, W.: Complexity compression and evolution. In: Eshelman, L. (ed.) Genetic Algorithms: Proc. of Sixth International Conf (ICGA 1995), pp. 310\u2013317, 15-19. Morgan Kaufmann, Pittsburgh (1995)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1007\/3-540-45110-2_3","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"M. Pelikan","year":"2003","unstructured":"Pelikan, M., Goldberg, D.E.: Hierarchical BOA solves Ising spin glasses and MAXSAT. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 1271\u20131282. Springer, Heidelberg (2003)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1162\/106365600750078808","volume":"9","author":"M. Pelikan","year":"2000","unstructured":"Pelikan, M., Goldberg, D.E., Cant\u00fa-Paz, E.: Linkage problem, distribution estimation, and Bayesian networks. Evolutionary Computation\u00a09, 311\u2013340 (2000)","journal-title":"Evolutionary Computation"},{"key":"5_CR17","unstructured":"Pelikan, M., Goldberg, D.E., Lobo, F.: A survey of optimization by building and using probabilistic models. Technical Report IlliGAL-99018, Illinois Genetic Algorithms Laboratory (1999)"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1162\/106365603322519288","volume":"11","author":"F. Rothlauf","year":"2003","unstructured":"Rothlauf, F., Goldberg, D.E.: Redundant representations in Evolutionary Computation. Evolutionary Computation\u00a011, 381\u2013415 (2003)","journal-title":"Evolutionary Computation"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1010017207202","volume":"1","author":"C.R. Stephens","year":"2000","unstructured":"Stephens, C.R., Vargas, J.M.: Effective fitness as an alternative paradigm for evolutionary computation I: General formalism. Genetic Programming and Evolvable Machines\u00a01, 363\u2013378 (2000)","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-45105-6_8","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"M. Toussaint","year":"2003","unstructured":"Toussaint, M.: Demonstrating the evolution of complex genetic representations: An evolution of artificial plants. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 86\u201397. Springer, Heidelberg (2003)"},{"key":"5_CR21","unstructured":"Toussaint, M.: The evolution of genetic representations and modular neural adaptation, April 2003. PhD thesis, Institut f\u00fcr Neuroinformatik, Ruhr-Universi\u00e4t- Bochum, Germany. Published with the Logos Verlag Berlin, 173 pages (2004) ISBN 3-8325- 0579-2"},{"key":"5_CR22","first-page":"169","volume-title":"Foundations of Genetic Algorithms 7 (FOGA VII)","author":"M. Toussaint","year":"2003","unstructured":"Toussaint, M.: On the evolution of phenotypic exploration distributions. In: Cotta, C., De Jong, K., Poli, R., Rowe, J. (eds.) Foundations of Genetic Algorithms 7 (FOGA VII), pp. 169\u2013182. Morgan Kaufmann, San Francisco (2003)"},{"key":"5_CR23","unstructured":"Toussaint, M.: Notes on information geometry and evolutionary processes (2004) Los Alamos pre-print nlin.AO\/0408040"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/18.825807","volume":"IT-46","author":"P.M.B. Vit\u00e1nyi","year":"2000","unstructured":"Vit\u00e1nyi, P.M.B., Li, M.: Minimum Description Length induction, Bayesianism, and Kolmogorov complexity. IEEE Trans. Inform. Theory\u00a0IT-46, 446\u2013464 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"967","DOI":"10.2307\/2410639","volume":"50","author":"G.P. Wagner","year":"1996","unstructured":"Wagner, G.P., Altenberg, L.: Complex adaptations and the evolution of evolvability. Evolution\u00a050, 967\u2013976 (1996)","journal-title":"Evolution"},{"key":"5_CR26","unstructured":"Watson, R.A., Pollack, J.B.: Hierarchically consistent test problems for genetic algorithms: Summary and additional results. In: Late breaking papers at the Genetic and Evolutionary Computation Conference, pp. 292\u2013297 (1999)"},{"key":"5_CR27","first-page":"39","volume-title":"Genetic Algorithms and Evolution Strategy in Engineering and Computer Science","author":"D. Whitley","year":"1997","unstructured":"Whitley, D., Rana, S., Heckendorn, R.: Representation issues in neighborhood search and evolutionary algorithms. In: Genetic Algorithms and Evolution Strategy in Engineering and Computer Science, pp. 39\u201358. John Wiley & Sons Ltd., Chichester (1997)"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-24855-2_30","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"H. Wright","year":"2004","unstructured":"Wright, H., Poli, R., Stephens, C.R., Langdon, W.B., Pulavarty, S.: An Estimation of Distribution Algorithm based on maximum entropy. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol.\u00a03103, pp. 343\u2013354. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11513575_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T02:45:27Z","timestamp":1559702727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11513575_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540272373","9783540320357"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11513575_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}