{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T06:21:19Z","timestamp":1738218079987,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_17","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T20:28:06Z","timestamp":1210105686000},"page":"172-183","source":"Crossref","is-referenced-by-count":4,"title":["Operator Learning for a Problem Class in a Distributed Peer-to-Peer Environment"],"prefix":"10.1007","author":[{"given":"M\u00e1rk","family":"Jelasity","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Preu\u03b2","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. E.","family":"Eiben","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"M. J. Coster","year":"1992","unstructured":"M. J. Coster, A. Joux, B. A. LaMacchia, A. M. Odlyzko, C.-P. Schnorr, and J. Stern. An improved low-density subset sum algorithm. Computational Complexity, 2:111\u2013128, 1992.","journal-title":"Computational Complexity"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database management. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (PODC\u201987), pages 1\u201312, Vancouver, Aug. 1987. ACM.","DOI":"10.1145\/41840.41841"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"A. E. Eiben","year":"1999","unstructured":"A. E. Eiben, R. Hinterding, and Z. Michalewicz. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 3(2):124\u2013141, July 1999.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"\u00c1. E. Eiben and M. Jelasity. A critical note on experimental research methodology in EC. In Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002) [8], pages 582\u2013587.","DOI":"10.1109\/CEC.2002.1006991"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"A. E. Eiben and C. A. Schippers. Multi-parent\u2019s niche: n-ary crossovers on NKlandscapes. In W. Ebeling, I. Rechenberg, H.-P. Schwefel, and H.-M. Voigt, editors, Parallel Problem Solving from Nature\u2014 PPSN IV, volume 1141 of Lecture Notes in Computational Science, pages 319\u2013328. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61723-X_996"},{"key":"17_CR6","unstructured":"I. Foster and C. Kesselman, editors. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, 1999."},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TSMC.1986.289288","volume":"16","author":"J. J. Grefenstette","year":"1986","unstructured":"J. J. Grefenstette. Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, 16(1):122\u2013128, 1986.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"17_CR8","unstructured":"IEEE. Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002). IEEE Press, 2002."},{"key":"17_CR9","unstructured":"M. Jelasity. A wave analysis of the subset sum problem. In T. B\u00e4ck, editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 89\u201396, San Francisco, California, 1997. Morgan Kaufmann."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"M. Jelasity, M. Preu\u03b2, M. van Steen, and B. Paechter. Maintaining connectivity in a scalable and robust distributed environment. In H. E. Bal, K.-P. L\u00f6hr, and A. Reinefeld, editors, Proceedings of the 2nd IEEE\/ACM International Symposium on Cluster Computing and the Grid (CCGrid2002), pages 389\u2013394, Berlin, Germany, 2002.","DOI":"10.1109\/CCGRID.2002.1017166"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"M. Jelasity, M. Preu\u03b2, and B. Paechter. A scalable and robust framework for distributed applications. In Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002) [8], pages 1540\u20131545.","DOI":"10.1109\/CEC.2002.1004471"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"M. Jelasity. Towards automatic domain knowledge extraction for evolutionary heuristics. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature\u2014 PPSN VI, volume 1917 of Lecture Notes in Computational Science, pages 755\u2013764. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-45356-3_74"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"B. Paechter, T. B\u00e4ck, M. Schoenauer, M. Sebag, A. E. Eiben, J. J. Merelo, and T. C. Fogarty. A distributed resoucre evolutionary algorithm machine (DREAM). In Proceedings of the 2000 Congress on Evolutionary Computation (CEC 2000), pages 951\u2013958. IEEE, IEEE Press, 2000.","DOI":"10.1109\/CEC.2000.870746"},{"key":"17_CR14","unstructured":"M. Pelikan, D. E. Goldberg, and F. Lobo. A survey of optimization by building and using probablistic models. Technical Report 99018, Illinois Genetic Algorithms Laboratory, 1999."},{"key":"17_CR15","unstructured":"R. G. Reynolds. Cultural algorithms: Theory and applications. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, Advanced Topics in Computer Science, pages 367\u2013377. McGrow-Hill, 1999."},{"key":"17_CR16","unstructured":"A. S. Tanenbaum and M. van Steen. Distributed Systems: Principles and Paradigms. Prentice Hall, 2002."}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T03:44:47Z","timestamp":1738208687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45712-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441397","9783540457121"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45712-7_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}