{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T02:41:28Z","timestamp":1648780888916},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s11047-013-9395-4","type":"journal-article","created":{"date-parts":[[2013,9,30]],"date-time":"2013-09-30T05:18:38Z","timestamp":1380518318000},"page":"473-484","source":"Crossref","is-referenced-by-count":0,"title":["Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning"],"prefix":"10.1007","volume":"12","author":[{"given":"Boris S.","family":"Mitavskiy","sequence":"first","affiliation":[]},{"given":"Elio","family":"Tuci","sequence":"additional","affiliation":[]},{"given":"Chris","family":"Cannings","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Rowe","sequence":"additional","affiliation":[]},{"given":"Jun","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,1]]},"reference":[{"key":"9395_CR1","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.2307\/1427934","volume":"27","author":"R Agrawal","year":"1995","unstructured":"Agrawal R (1995) Sample mean based index policies with o (logn) regret for the multi-armed bandit problem. Adv Appl Probab 27:1054\u20131078","journal-title":"Adv Appl Probab"},{"key":"9395_CR2","first-page":"397","volume":"3","author":"P Auer","year":"2002","unstructured":"Auer P (2002) Using confidence bounds for exploration\u2013exploitation trade-offs. J Mach Learn Res 3:397\u2013422","journal-title":"J Mach Learn Res"},{"key":"9395_CR3","doi-asserted-by":"crossref","DOI":"10.1142\/7438","volume-title":"Theory of randomized search heuristics. Series on theoretical computer science","author":"A Auger","year":"2011","unstructured":"Auger A, Doerr B (2011) Theory of randomized search heuristics. Series on theoretical computer science. Elsevier, Amsterdam"},{"key":"9395_CR4","volume-title":"Category theory for computing science","author":"M Barr","year":"1998","unstructured":"Barr M, Wells C (1998) Category theory for computing science. Prentice Hall, Upper Saddle River"},{"key":"9395_CR6","volume-title":"Integral biomathics: tracing the road to reality","author":"A Ehresmann","year":"2012","unstructured":"Ehresmann A, Smeonov P (2012) Wlimes: towards a theoretical framework for wandering logic intelligence memory evolutive systems. In: Simeonov PL, Smith LS, Ehresmann AC (eds) Integral biomathics: tracing the road to reality. Springer, Heidelberg"},{"key":"9395_CR7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10516-005-6001-0","volume":"16","author":"A Ehresmann","year":"2006","unstructured":"Ehresmann A, Vanbremeersch JP (2006) The memory evolutive systems as a model of Rosens organisms. Axiomathes 16:165\u2013214","journal-title":"Axiomathes"},{"key":"9395_CR8","volume-title":"Memory evolutive systems: hierarchy, emergence, cognition, studies in multidisciplinarity","author":"A Ehresmann","year":"2007","unstructured":"Ehresmann A, Vanbremeersch JP (2007) Memory evolutive systems: hierarchy, emergence, cognition, studies in multidisciplinarity, vol 4. Elsevier, Amsterdam"},{"issue":"5","key":"9395_CR5","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1080\/0308107042000193534","volume":"33","author":"A Ehresmann","year":"2004","unstructured":"Ehresmann A, Baas N, Vanbremeersch JP (2004) Hyperstructures and memory evolutive systems. Int J Gen Syst 33(5):553\u2013568","journal-title":"Int J Gen Syst"},{"key":"9395_CR9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1214\/aoms\/1177731313","volume":"15","author":"H Geiringer","year":"1944","unstructured":"Geiringer H (1944) On the probability of linkage in mendelian heredity. Ann Math Stat 15:25\u201357","journal-title":"Ann Math Stat"},{"key":"9395_CR10","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1093\/genetics\/33.6.548","volume":"33","author":"H Geiringer","year":"1948","unstructured":"Geiringer H (1948) On the mathematics of random mating in case of different recombination values for males and females. Genetics 33:548\u2013564","journal-title":"Genetics"},{"key":"9395_CR11","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1093\/genetics\/34.6.665","volume":"34","author":"H Geiringer","year":"1949","unstructured":"Geiringer H (1949) Chromatid segregation of tetraploids and hexaploids. Genetics 34:665\u2013684","journal-title":"Genetics"},{"key":"9395_CR12","volume-title":"The organization of behavior","author":"DO Hebb","year":"1949","unstructured":"Hebb DO (1949) The organization of behavior. Wiley, New York"},{"key":"9395_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the working mathematician","author":"S Mc Lane","year":"1971","unstructured":"Mc Lane S (1971) Categories for the working mathematician. Springer, New York"},{"key":"9395_CR14","doi-asserted-by":"crossref","unstructured":"Mitavskiy B, Cannings C (2006) Exploiting quotients of Markov chains to derive properties of the stationary distribution of the Markov chain associated to an evolutionary algorithm. In: Simulated evolution and learning (SEAL-2006), Hefei","DOI":"10.1007\/11903697_91"},{"issue":"3","key":"9395_CR15","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1162\/evco.2009.17.3.343","volume":"17","author":"B Mitavskiy","year":"2009","unstructured":"Mitavskiy B, Cannings C (2009) Estimating the ratios of the stationary distributions of Markov chains modeling evolutionary algorithms using the quotient construction method. Evol Comput 17(3):343\u2013377","journal-title":"Evol Comput"},{"key":"9395_CR16","doi-asserted-by":"crossref","unstructured":"Mitavskiy B, He J (2013) A further generalization of the finite-population Geiringer-like theorem for POMDPs to allow recombination over arbitrary set covers. In: Foundations of genetic algorithms 12 (FOGA-2013). ACM Press, New York","DOI":"10.1145\/2460239.2460252"},{"key":"9395_CR17","doi-asserted-by":"crossref","unstructured":"Mitavskiy B, Rowe J (2005) A schema-based version of Geiringer theorem for nonlinear genetic programming with homologous crossover. In: Foundations of genetic algorithms 8 (FOGA-2005). Lecture notes in computer science, vol 3469. Springer, Heidelberg, pp 156\u2013175","DOI":"10.1007\/11513575_9"},{"issue":"1","key":"9395_CR18","first-page":"87","volume":"14","author":"B Mitavskiy","year":"2006","unstructured":"Mitavskiy B, Rowe J (2006) An extension of Geiringer theorem for a wide class of evolutionary algorithms. Evol Comput 14(1):87\u2013118","journal-title":"Evol Comput"},{"key":"9395_CR21","doi-asserted-by":"crossref","unstructured":"Mitavskiy B, Rowe J, Wright A, Schmitt L (2007) An improvement of the quotient construction method and further asymptotic results on the stationary distribution of the Markov chains modeling evolutionary algorithms. In: IEEE congress on evolutionary computation (CEC-2007), Singapore","DOI":"10.1109\/CEC.2007.4424799"},{"issue":"3","key":"9395_CR22","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10710-007-9038-6","volume":"17","author":"B Mitavskiy","year":"2008","unstructured":"Mitavskiy B, Rowe J, Wright A, Schmitt L (2008) Quotients of Markov chains and asymptotic properties of the stationary distribution of the Markov chain associated to an evolutionary algorithm. Genet Program Evol Mach 17(3):109\u2013123","journal-title":"Genet Program Evol Mach"},{"issue":"1","key":"9395_CR20","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1108\/17563781211208233","volume":"5","author":"B Mitavskiy","year":"2012","unstructured":"Mitavskiy B, Rowe J, Cannings C (2012) A version of Geiringer-like theorem for decision making in the environments with randomness and incomplete information. Int J Intell Comput Cybern 5(1):36\u201390","journal-title":"Int J Intell Comput Cybern"},{"key":"9395_CR23","doi-asserted-by":"crossref","unstructured":"Muhlenbein H (1991) Parallel genetic algorithms, population genetics, and combinatorial optimization. In: Parallelism, learning, evolution, Neubiberg, pp 398\u2013406","DOI":"10.1007\/3-540-55027-5_23"},{"key":"9395_CR24","unstructured":"Poli R, Stephens C, Wright A, Rowe J (2002) A schema-theory-based extension of Geiringer\u2019s theorem for linear GP and variable-length GAs under homologous crossover. In: Foundations of genetic algorithms (FOGA 2002), Torremolinos, pp 45\u201362"},{"key":"9395_CR25","doi-asserted-by":"crossref","unstructured":"Rabani Y, Rabinovich Y, Sinclair A (1995) A computational view of population genetics. In: Annual ACM symposium on the theory of computing. ACM Press, New York, pp 83\u201392","DOI":"10.1145\/225058.225088"},{"key":"9395_CR26","volume-title":"Natural and artificial intelligence","author":"J Weng","year":"2012","unstructured":"Weng J (2012) Natural and artificial intelligence. BMI Press, Okemos"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-013-9395-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-013-9395-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-013-9395-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T04:46:30Z","timestamp":1646628390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-013-9395-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,1]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["9395"],"URL":"https:\/\/doi.org\/10.1007\/s11047-013-9395-4","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,1]]}}}