{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T15:57:10Z","timestamp":1774886230895,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540876991","type":"print"},{"value":"9783540877004","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87700-4_18","type":"book-chapter","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T11:50:04Z","timestamp":1221306604000},"page":"175-184","source":"Crossref","is-referenced-by-count":58,"title":["Extreme Value Based Adaptive Operator Selection"],"prefix":"10.1007","author":[{"given":"\u00c1lvaro","family":"Fialho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu\u00eds","family":"Da Costa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Schoenauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mich\u00e8le","family":"Sebag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Parameter Setting in Evolutionary Algorithms","year":"2007","unstructured":"Lobo, F., Lima, C., Michalewicz, Z. (eds.): Parameter Setting in Evolutionary Algorithms. Springer, Heidelberg (2007)"},{"key":"18_CR2","first-page":"11","volume-title":"Proc. GECCO 2002","author":"M. Birattari","year":"2002","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Langdon, W.B., et al. (eds.) Proc. GECCO 2002, pp. 11\u201318. Morgan Kaufmann, San Francisco (2002)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-30217-9_18","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"B. Yuan","year":"2004","unstructured":"Yuan, B., Gallagher, M.: Statistical racing techniques for improved empirical evaluation of evolutionary algorithms. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol.\u00a03242, pp. 172\u2013181. Springer, Heidelberg (2004)"},{"key":"18_CR4","first-page":"773","volume-title":"Proc. CEC 2005","author":"T. Bartz-Beielstein","year":"2005","unstructured":"Bartz-Beielstein, T., Lasarczyk, C., Preuss, M.: Sequential parameter optimization. In: Proc. CEC 2005, IEEE Press, pp. 773\u2013780. IEEE Press, Los Alamitos (2005)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Nannen, V., Eiben, A.E.: Relevance estimation and value calibration of evolutionary algorithm parameters. In: Proc. IJCAI 2007, Hyderabad, India, pp. 975\u2013980 (2007)","DOI":"10.1109\/CEC.2007.4424460"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"De Jong, K.: Parameter Setting in EAs: a 30 Year Perspective. In: [1], pp. 1\u201318","DOI":"10.1007\/978-3-540-69432-8_1"},{"issue":"4","key":"18_CR7","first-page":"407","volume":"5","author":"D. Goldberg","year":"1990","unstructured":"Goldberg, D.: Probability Matching, the Magnitude of Reinforcement, and Classifier System Bidding. Machine Learning\u00a05(4), 407\u2013426 (1990)","journal-title":"Machine Learning"},{"key":"18_CR8","first-page":"1539","volume-title":"Proc. GECCO 2005","author":"D. Thierens","year":"2005","unstructured":"Thierens, D.: An adaptive pursuit strategy for allocating operator probabilities. In: Beyer, H.G. (ed.) Proc. GECCO 2005, pp. 1539\u20131546. ACM Press, New York (2005)"},{"key":"18_CR9","volume-title":"Proc. GECCO 2008","author":"L. Da Costa","year":"2008","unstructured":"Da Costa, L., Fialho, A., Schoenauer, M., Sebag, M.: Adaptive operator selection with dynamic multi-armed bandits. In: Keijzer, M., et al. (eds.) Proc. GECCO 2008, ACM Press, New York (to appear, 2008)"},{"key":"18_CR10","first-page":"61","volume-title":"Proc. ICGA 1989","author":"L. Davis","year":"1989","unstructured":"Davis, L.: Adapting operator probabilities in genetic algorithms. In: Schaffer, J.D. (ed.) Proc. ICGA 1989, pp. 61\u201369. Morgan Kaufmann, San Francisco (1989)"},{"key":"18_CR11","first-page":"121","volume-title":"Proc. ICEC 1997","author":"F. Lobo","year":"1997","unstructured":"Lobo, F., Goldberg, D.: Decision making in a hybrid genetic algorithm. In: Proc. ICEC 1997, pp. 121\u2013125. IEEE Press, Los Alamitos (1997)"},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1162\/evco.1998.6.2.161","volume":"6","author":"A. Tuson","year":"1998","unstructured":"Tuson, A., Ross, P.: Adapting operator settings in genetic algorithms. Evolutionary Computation\u00a06(2), 161\u2013184 (1998)","journal-title":"Evolutionary Computation"},{"key":"18_CR13","unstructured":"Barbosa, H.J.C., e S\u00e1, A.M.: On adaptive operator probabilities in real coded genetic algorithms. In: XX Intl. Conf. of the Chilean Computer Science Society (2000)"},{"key":"18_CR14","first-page":"81","volume-title":"Proc. ICGA 1995","author":"B.A. Julstrom","year":"1995","unstructured":"Julstrom, B.A.: What have you done for me lately? adapting operator probabilities in a steady-state genetic algorithm on genetic algorithms. In: Eshelman, L.J. (ed.) Proc. ICGA 1995, pp. 81\u201387. Morgan Kaufmann, San Francisco (1995)"},{"key":"18_CR15","first-page":"1345","volume-title":"Proc. GECCO 2006","author":"J.M. Whitacre","year":"2006","unstructured":"Whitacre, J.M., Pham, T.Q., Sarker, R.A.: Use of statistical outlier detection method in adaptive evolutionary algorithms. In: Cattolico, M. (ed.) Proc. GECCO 2006, pp. 1345\u20131352. ACM, New York (2006)"},{"issue":"2\/3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning\u00a047(2\/3), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1093\/biomet\/41.1-2.100","volume":"41","author":"E. Page","year":"1954","unstructured":"Page, E.: Continuous inspection schemes. Biometrika\u00a041, 100\u2013115 (1954)","journal-title":"Biometrika"},{"issue":"2","key":"18_CR18","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-adaptation in evolution strategies. Evolutionary Computation\u00a09(2), 159\u2013195 (2001)","journal-title":"Evolutionary Computation"},{"issue":"4","key":"18_CR19","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1162\/evco.2007.15.4.411","volume":"15","author":"S. Gelly","year":"2007","unstructured":"Gelly, S., Ruette, S., Teytaud, O.: Comparison-based algorithms are robust and randomized algorithms are anytime. Evolutionary Comp.\u00a015(4), 411\u2013434 (2007)","journal-title":"Evolutionary Comp."}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:28:42Z","timestamp":1557793722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87700-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876991","9783540877004"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87700-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}