{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:40:22Z","timestamp":1725518422105},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540876991"},{"type":"electronic","value":"9783540877004"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87700-4_49","type":"book-chapter","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T07:50:04Z","timestamp":1221292204000},"page":"488-497","source":"Crossref","is-referenced-by-count":2,"title":["Evolvable Agents in Static and Dynamic Optimization Problems"],"prefix":"10.1007","author":[{"given":"Juan L. J.","family":"Laredo","sequence":"first","affiliation":[]},{"given":"Pedro A.","family":"Castillo","sequence":"additional","affiliation":[]},{"given":"Antonio M.","family":"Mora","sequence":"additional","affiliation":[]},{"given":"Juan J.","family":"Merelo","sequence":"additional","affiliation":[]},{"given":"Agostinho","family":"Rosa","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Fernandes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A connectionist machine for genetic hillclimbing","author":"D.H. Ackley","year":"1987","unstructured":"Ackley, D.H.: A connectionist machine for genetic hillclimbing. Kluwer Academic Publishers, Norwell (1987)"},{"key":"49_CR2","series-title":"Operations Research\/Computer Science Interfaces","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-0-387-71921-4_13","volume-title":"Meteheuristics","author":"E. Alba","year":"2007","unstructured":"Alba, E., Badia, J.S., Luque, G.: A Study of Canonical GAs for NSOPs. In: Meteheuristics. Operations Research\/Computer Science Interfaces, vol.\u00a039, pp. 245\u2013260. Springer, US (2007)"},{"key":"49_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014795","volume-title":"Evolutionary Programming VI","author":"P.J. Angeline","year":"1997","unstructured":"Angeline, P.J.: Tracking extrema in dynamic environments. In: Angeline, P.J., McDonnell, J.R., Reynolds, R.G., Eberhart, R. (eds.) EP 1997. LNCS, vol.\u00a01213. Springer, Heidelberg (1997)"},{"key":"49_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to Evolutionary Computing","author":"A.E. Eiben","year":"2003","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Heidelberg (2003)"},{"issue":"5","key":"49_CR5","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TEVC.2005.850298","volume":"9","author":"M. Giacobini","year":"2005","unstructured":"Giacobini, M., Tomassini, M., Tettamanzi, A., Alba, E.: Selection intensity in cellular evolutionary algorithms for regular lattices. IEEE Transactions on Evolutionary Computation\u00a09(5), 489\u2013505 (2005)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"49_CR6","series-title":"LNCS","first-page":"1138","volume-title":"GECCO 2004: Proceedings of the 2004 conference on Genetic and evolutionary computation","author":"M. Giacobini","year":"1996","unstructured":"Giacobini, M., Alba, E., Tettamanzi, A., Tomassini, M.: Modeling selection intensity for toroidal cellular evolutionary algorithms. In: EWSPT 1996. LNCS, vol.\u00a01149, pp. 1138\u20131149. Springer, Heidelberg (1996)"},{"key":"49_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/11730095_8","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M. Giacobini","year":"2006","unstructured":"Giacobini, M., Preuss, M., Tomassini, M.: Effects of scale-free and small-world topologies on binary coded self-adaptive CEA. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol.\u00a03906, pp. 85\u201396. Springer, Heidelberg (2006)"},{"key":"49_CR8","unstructured":"Jelasity, M., van Steen, M.: Large-scale newscast computing on the Internet. Technical Report IR-503, Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands (October 2002)"},{"key":"49_CR9","first-page":"2801","volume-title":"GECCO 2007","author":"J.L.J. Laredo","year":"2007","unstructured":"Laredo, J.L.J., Eiben, E.A., Schoenauer, M., Castillo, P.A., Mora, A.M., Merelo, J.J.: Exploring selection mechanisms for an agent-based distributed evolutionary algorithm. In: GECCO 2007, pp. 2801\u20132808. ACM Press, New York (2007)"},{"key":"49_CR10","first-page":"2610","volume-title":"IEEE Congress on Evolutionary Computation (CEC2008), WCCI 2008 Proceedings","author":"J.L.J. Laredo","year":"2008","unstructured":"Laredo, J.L.J., Castillo, P.A., Mora, A.M., Merelo, J.J.: Exploring population structures for locally concurrent and massively parallel evolutionary algorithms. In: IEEE Congress on Evolutionary Computation (CEC2008), WCCI 2008 Proceedings, June 2008, pp. 2610\u20132617. IEEE Computer Society Press, Los Alamitos (2008)"},{"key":"49_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-30217-9_10","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"M. Preuss","year":"2004","unstructured":"Preuss, M., Lasarczyk, C.: On the importance of information speed in structured populations. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria, J.A., Rowe, J.E., Ti\u0148o, P., Kab\u00e1n, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol.\u00a03242, pp. 91\u2013100. Springer, Heidelberg (2004)"},{"key":"49_CR12","first-page":"572","volume-title":"GECCO 1999","author":"J. Sarma","year":"1999","unstructured":"Sarma, J., De Jong, K.A.: The behavior of spatially distributed evolutionary algorithms in non-stationary environments. In: Banzhaf, W., Daida, J.M., Eiben, E.A., Garzon, M.H., Honavar, V., Jakiela, M., Smith, R.E. (eds.) GECCO 1999, Orlando, FL, USA, pp. 572\u2013578. Morgan Kaufmann, San Francisco (1999)"},{"key":"49_CR13","unstructured":"Sastry, K.: Evaluation-relaxation schemes for genetic and evolutionary algorithms. Technical Report 2002004, University of Illinois at Urbana-Champaign, Urbana, IL (2001)"},{"issue":"3","key":"49_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10710-007-9024-z","volume":"8","author":"R. Tin\u00f3s","year":"2007","unstructured":"Tin\u00f3s, R., Yang, S.: A self-organizing random immigrants genetic algorithm for dynamic optimization problems. Genetic Programming and Evolvable Machines\u00a08(3), 255\u2013286 (2007)","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"49_CR15","series-title":"Natural Computing Series","volume-title":"Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time","author":"M. Tomassini","year":"2005","unstructured":"Tomassini, M.: Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time. Natural Computing Series. Springer, New York (2005)"},{"key":"49_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-25840-7_6","volume-title":"Agents and Peer-to-Peer Computing","author":"S. Voulgaris","year":"2004","unstructured":"Voulgaris, S., Jelasity, M., van Steen, M.: A Robust and Scalable Peer-to-Peer Gossiping Protocol. In: Moro, G., Sartori, C., Singh, M.P. (eds.) AP2PC 2003. LNCS (LNAI), vol.\u00a02872, pp. 47\u201358. Springer, Heidelberg (2004)"},{"issue":"11","key":"49_CR17","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s00500-004-0422-3","volume":"9","author":"S. Yang","year":"2005","unstructured":"Yang, S., Yao, X.: Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Comput.\u00a09(11), 815\u2013834 (2005)","journal-title":"Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN X"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87700-4_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T04:38:02Z","timestamp":1551587882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87700-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876991","9783540877004"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87700-4_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}