{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:55:25Z","timestamp":1725908125696},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319656359"},{"type":"electronic","value":"9783319656366"}],"license":[{"start":{"date-parts":[[2017,8,17]],"date-time":"2017-08-17T00:00:00Z","timestamp":1502928000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-65636-6_28","type":"book-chapter","created":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T04:13:28Z","timestamp":1502856808000},"page":"313-325","source":"Crossref","is-referenced-by-count":0,"title":["Designing an Efficient Self-adaptive Parallel Algorithm Using Math Oracles"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Luque","sequence":"first","affiliation":[]},{"given":"Enrique","family":"Alba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of Metaheuristics","author":"E Burke","year":"2003","unstructured":"Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyper-heuristics: an emerging direction in modern search technology. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 457\u2013474. Springer, Boston (2003)"},{"doi-asserted-by":"crossref","unstructured":"Burke, E.K., Curtois, T., Hyde, M., Kendall, G., Ochoa, G., Petrovic, S., Vazquez-Rodriguez, J.A., Gendreau, M.: Iterated local search vs. hyper-heuristics: towards general-purpose search algorithms. In: IEEE Congress on Evolutionary Computation (CEC 2010), pp. 3073\u20133080 (2010)","key":"28_CR2","DOI":"10.1109\/CEC.2010.5586064"},{"key":"28_CR3","first-page":"69","volume-title":"Foundations of Genetic Algorithms","author":"DE Goldberg","year":"1991","unstructured":"Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: Rawlins, G.J. (ed.) Foundations of Genetic Algorithms, pp. 69\u201393. Morgan Kaufmann, San Mateo (1991)"},{"issue":"1","key":"28_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s00453-002-0940-2","volume":"34","author":"T Jansen","year":"2002","unstructured":"Jansen, T., Wegener, I.: The analysis of evolutionary algorithms-a proof that crossover really can help. Algorithmica 34(1), 47\u201366 (2002)","journal-title":"Algorithmica"},{"issue":"4","key":"28_CR5","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1162\/EVCO_a_00039","volume":"19","author":"F Chicano","year":"2011","unstructured":"Chicano, F., Whitley, L.D., Alba, E.: A methodology to find the elementary landscape decomposition of combinatorial optimization problems. Evol. Comput. 19(4), 597\u2013637 (2011)","journal-title":"Evol. Comput."},{"doi-asserted-by":"crossref","unstructured":"Osorio, K., Luque, G., Alba, E.: Distributed evolutionary algorithms with adaptive migration period. In: 2011 11th International Conference on Intelligent Systems Design and Applications (ISDA), pp. 259\u2013264, November 2011","key":"28_CR6","DOI":"10.1109\/ISDA.2011.6121665"},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1109\/TEVC.2002.800880","volume":"6","author":"E Alba","year":"2002","unstructured":"Alba, E., Tomassini, M.: Parallelism and evolutionary algorithms. IEEE Trans. Evol. Comput. 6, 443\u2013462 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"doi-asserted-by":"crossref","unstructured":"Alba, E., Luque, G.: Theoretical models of selection pressure for dEAs: topology influence. In: The 2005 IEEE Congress on Evolutionary Computation, 2005, vol. 1, pp. 214\u2013 221 (2005)","key":"28_CR8","DOI":"10.1109\/CEC.2005.1554687"},{"key":"28_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1990)"},{"key":"28_CR10","first-page":"331","volume-title":"Where the Really Hard Problems Are","author":"P Cheeseman","year":"1991","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the Really Hard Problems Are, pp. 331\u2013337. Morgan Kaufmann, San Francisco (1991)"},{"key":"28_CR11","first-page":"1","volume":"5","author":"J Demsar","year":"2006","unstructured":"Demsar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 5, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advances in Intelligent Networking and Collaborative Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-65636-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T04:23:01Z","timestamp":1502857381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-65636-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,17]]},"ISBN":["9783319656359","9783319656366"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-65636-6_28","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2017,8,17]]}}}