{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:41:19Z","timestamp":1759848079279,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T00:00:00Z","timestamp":1677024000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T00:00:00Z","timestamp":1677024000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002261","name":"\u0420\u043e\u0441\u0441\u0438\u0439\u0441\u043a\u0438\u0439 \u0424\u043e\u043d\u0434 \u0424\u0443\u043d\u0434\u0430\u043c\u0435\u043d\u0442\u0430\u043b\u044c\u043d\u044b\u0445 \u0418\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u043d\u0438\u0439","doi-asserted-by":"publisher","award":["20-51-15009"],"award-info":[{"award-number":["20-51-15009"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004794","name":"Centre National de la Recherche Scientifique","doi-asserted-by":"publisher","award":["20-51-15009"],"award-info":[{"award-number":["20-51-15009"]}],"id":[{"id":"10.13039\/501100004794","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-LABX-0056-LMH"],"award-info":[{"award-number":["ANR-11-LABX-0056-LMH"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2024,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Most evolutionary algorithms have multiple parameters and their values drastically affect the performance. Due to the often complicated interplay of the parameters, setting these values right for a particular problem (parameter tuning) is a challenging task. This task becomes even more complicated when the optimal parameter values change significantly during the run of the algorithm since then a dynamic parameter choice (parameter control) is necessary. In this work, we propose a lazy but effective solution, namely choosing all parameter values (where this makes sense) in each iteration randomly from a suitably scaled power-law distribution. To demonstrate the effectiveness of this approach, we perform runtime analyses of the<jats:inline-formula><jats:alternatives><jats:tex-math>$$(1+(\\lambda ,\\lambda ))$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mo>(<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>+<\/mml:mo><mml:mo>(<\/mml:mo><mml:mi>\u03bb<\/mml:mi><mml:mo>,<\/mml:mo><mml:mi>\u03bb<\/mml:mi><mml:mo>)<\/mml:mo><mml:mo>)<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>genetic algorithm with all three parameters chosen in this manner. We show that this algorithm on the one hand can imitate simple hill-climbers like the<jats:inline-formula><jats:alternatives><jats:tex-math>$$(1+1)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mo>(<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>+<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>)<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>EA, giving the same asymptotic runtime on problems like OneMax, LeadingOnes, or Minimum Spanning Tree. On the other hand, this algorithm is also very efficient on jump functions, where the best static parameters are very different from those necessary to optimize simple problems. We prove a performance guarantee that is comparable to the best performance known for static parameters. For the most interesting case that the jump size<jats:italic>k<\/jats:italic>is constant, we prove that our performance is asymptotically better than what can be obtained with any static parameter choice. We complement our theoretical results with a rigorous empirical study confirming what the asymptotic runtime results suggest.<\/jats:p>","DOI":"10.1007\/s00453-023-01098-z","type":"journal-article","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T13:03:11Z","timestamp":1677070991000},"page":"442-484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7906-096X","authenticated-orcid":false,"given":"Denis","family":"Antipov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Buzdalov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,22]]},"reference":[{"key":"1098_CR1","doi-asserted-by":"crossref","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1115\u20131123. ACM (2021)","DOI":"10.1145\/3449639.3459377"},{"key":"1098_CR2","doi-asserted-by":"publisher","first-page":"1724","DOI":"10.1007\/s00453-022-00957-5","volume":"84","author":"D Antipov","year":"2022","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Fast mutation in crossover-based algorithms. Algorithmica 84, 1724\u20131761 (2022)","journal-title":"Algorithmica"},{"key":"1098_CR3","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B.: Runtime analysis of a heavy-tailed $$(1+(\\lambda , \\lambda ))$$ genetic algorithm on jump functions. In: Parallel Problem Solving From Nature, PPSN 2020, Part\u00a0II, pp. 545\u2013559. Springer (2020)","DOI":"10.1007\/978-3-030-58115-2_38"},{"key":"1098_CR4","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1007\/s00453-020-00731-5","volume":"83","author":"D Antipov","year":"2021","unstructured":"Antipov, D., Doerr, B.: A tight runtime analysis for the $$(\\mu +\\lambda )$$ EA. Algorithmica 83, 1054\u20131095 (2021)","journal-title":"Algorithmica"},{"key":"1098_CR5","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B., Karavaev, V.: A tight runtime analysis for the $${(1 + (\\lambda ,\\lambda ))}$$ GA on LeadingOnes. In: Foundations of Genetic Algorithms, FOGA 2019, pp. 169\u2013182. ACM (2019)","DOI":"10.1145\/3299904.3340317"},{"key":"1098_CR6","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1007\/s00453-021-00907-7","volume":"84","author":"D Antipov","year":"2022","unstructured":"Antipov, D., Doerr, B., Karavaev, V.: A rigorous runtime analysis of the $$(1 + (\\lambda,\\lambda ))$$ GA on jump functions. Algorithmica 84, 1573\u20131602 (2022)","journal-title":"Algorithmica"},{"key":"1098_CR7","doi-asserted-by":"crossref","unstructured":"Benbaki, R., Benomar, Z., Doerr, B.: A rigorous runtime analysis of the 2-MMAS$$_{{\\rm ib}}$$ on jump functions: ant colony optimizers can cope well with local optima. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 4\u201313. ACM (2021)","DOI":"10.1145\/3449639.3459350"},{"key":"1098_CR8","doi-asserted-by":"crossref","unstructured":"Buzdalov, M., Doerr, B.: Runtime analysis of the $${(1+(\\lambda ,\\lambda ))}$$ genetic algorithm on random satisfiable 3-CNF formulas. In: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 1343\u20131350. ACM (2017)","DOI":"10.1145\/3071178.3071297"},{"key":"1098_CR9","doi-asserted-by":"crossref","unstructured":"Badkobeh, G., Lehre, P.K., Sudholt, D.: Unbiased black-box complexity of parallel search. In: Parallel Problem Solving from Nature, PPSN 2014, pp. 892\u2013901. Springer (2014)","DOI":"10.1007\/978-3-319-10762-2_88"},{"key":"1098_CR10","doi-asserted-by":"crossref","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: On the runtime analysis of the Opt-IA artificial immune system. In: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 83\u201390. ACM (2017)","DOI":"10.1145\/3071178.3079194"},{"key":"1098_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.artint.2019.03.001","volume":"274","author":"D Corus","year":"2019","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem. Artif. Intell. 274, 180\u2013196 (2019)","journal-title":"Artif. Intell."},{"key":"1098_CR12","doi-asserted-by":"crossref","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: Automatic adaptation of hypermutation rates for multimodal optimisation. In: Foundations of Genetic Algorithms, FOGA 2021, pp. 4:1\u20134:12. ACM (2021)","DOI":"10.1145\/3450218.3477305"},{"key":"1098_CR13","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1007\/s00453-017-0354-9","volume":"80","author":"B Doerr","year":"2018","unstructured":"Doerr, B., Doerr, C.: Optimal static and self-adjusting parameter choices for the $${(1+(\\lambda,\\lambda ))}$$ genetic algorithm. Algorithmica 80, 1658\u20131709 (2018)","journal-title":"Algorithmica"},{"key":"1098_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2014.11.028","volume":"567","author":"B Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., Ebel, F.: From black-box complexity to designing new genetic algorithms. Theor. Comput. Sci. 567, 87\u2013104 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"1098_CR15","doi-asserted-by":"publisher","first-page":"1732","DOI":"10.1007\/s00453-017-0341-1","volume":"80","author":"B Doerr","year":"2018","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Static and self-adjusting mutation strengths for multi-valued decision variables. Algorithmica 80, 1732\u20131768 (2018)","journal-title":"Algorithmica"},{"key":"1098_CR16","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00453-018-0477-7","volume":"81","author":"B Doerr","year":"2019","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Solving problems with unknown solution length at almost no extra cost. Algorithmica 81, 703\u2013748 (2019)","journal-title":"Algorithmica"},{"key":"1098_CR17","doi-asserted-by":"crossref","unstructured":"Dang, D.-C., Eremeev, A.V., Lehre, P.K., Qin, X.: Fast non-elitist evolutionary algorithms with power-law ranking selection. In: Genetic and Evolutionary Computation Conference, GECCO 2022, pp. 1372\u20131380. ACM (2022)","DOI":"10.1145\/3512290.3528873"},{"key":"1098_CR18","doi-asserted-by":"crossref","unstructured":"Dang, D.-C., Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Lehre, P.K., Oliveto, P.S., Sudholt, D., Sutton, A.M.: Escaping local optima with diversity mechanisms and crossover. In: Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 645\u2013652. ACM (2016)","DOI":"10.1145\/2908812.2908956"},{"key":"1098_CR19","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/TEVC.2017.2724201","volume":"22","author":"D-C Dang","year":"2018","unstructured":"Dang, D.-C., Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Lehre, P.K., Oliveto, P.S., Sudholt, D., Sutton, A.M.: Escaping local optima using crossover with emergent diversity. IEEE Trans. Evol. Comput. 22, 484\u2013497 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1098_CR20","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1 + 1) evolutionary algorithm. Theor. Comput. Sci. 276, 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"1098_CR21","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64, 673\u2013697 (2012)","journal-title":"Algorithmica"},{"key":"1098_CR22","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 777\u2013784. ACM (2017)","DOI":"10.1145\/3071178.3071301"},{"key":"1098_CR23","doi-asserted-by":"crossref","unstructured":"Doerr, B.: Optimal parameter settings for the $$(1+(\\lambda , \\lambda ))$$ genetic algorithm. In: Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 1107\u20131114. ACM (2016)","DOI":"10.1145\/2908812.2908885"},{"key":"1098_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-030-29414-4","volume-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","author":"B Doerr","year":"2020","unstructured":"Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation: Recent Developments in Discrete Optimization, pp. 1\u201387. Springer, Cham (2020) . arXiv:1801.06733"},{"key":"1098_CR25","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1007\/s00453-020-00780-w","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B.: The runtime of the compact genetic algorithm on Jump functions. Algorithmica 83, 3059\u20133107 (2021)","journal-title":"Algorithmica"},{"key":"1098_CR26","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1007\/s00453-021-00896-7","volume":"84","author":"B Doerr","year":"2022","unstructured":"Doerr, B.: Does comma selection help to cope with local optima? Algorithmica 84, 1659\u20131693 (2022)","journal-title":"Algorithmica"},{"key":"1098_CR27","doi-asserted-by":"crossref","unstructured":"Doerr, B., Qu, Z.: A first runtime analysis of the NSGA-II on a multimodal problem. In: Parallel Problem Solving From Nature, PPSN 2022. Springer (2022). arXiv:2204.13750","DOI":"10.1145\/3583133.3595839"},{"key":"1098_CR28","doi-asserted-by":"crossref","unstructured":"Doerr, B., Rajabi, A.: Stagnation detection meets fast mutation. In: Evolutionary Computation in Combinatorial Optimization, EvoCOP 2022, pp. 191\u2013207. Springer (2022)","DOI":"10.1007\/978-3-031-04148-8_13"},{"key":"1098_CR29","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1007\/s00453-020-00726-2","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B., Witt, C., Yang, J.: Runtime analysis for self-adaptive mutation rates. Algorithmica 83, 1012\u20131053 (2021)","journal-title":"Algorithmica"},{"key":"1098_CR30","doi-asserted-by":"crossref","unstructured":"Doerr, B., Zheng, W.: Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives. In: Conference on Artificial Intelligence, AAAI 2021, pp. 12293\u201312301. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i14.17459"},{"key":"1098_CR31","doi-asserted-by":"crossref","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Nallaperuma, S., Neumann, F., Schirneck, M.: Fast building block assembly by majority vote crossover. In: Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 661\u2013668. ACM (2016)","DOI":"10.1145\/2908812.2908884"},{"key":"1098_CR32","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Quinzan, F., Wagner, M.: Escaping large deceptive basins of attraction with heavy-tailed mutation operators. In: Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 293\u2013300. ACM (2018)","DOI":"10.1145\/3205455.3205515"},{"key":"1098_CR33","doi-asserted-by":"crossref","unstructured":"Hasen\u00f6hrl, V., Sutton, A.M.: On the runtime dynamics of the compact genetic algorithm on jump functions. In: Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 967\u2013974. ACM (2018)","DOI":"10.1145\/3205455.3205608"},{"key":"1098_CR34","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1162\/106365605774666921","volume":"13","author":"T Jansen","year":"2005","unstructured":"Jansen, T., De Jong, K.A., Wegener, I.: On the choice of the offspring population size in evolutionary algorithms. Evol. Comput. 13, 413\u2013440 (2005)","journal-title":"Evol. Comput."},{"key":"1098_CR35","doi-asserted-by":"publisher","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\u2014a proof that crossover really can help. Algorithmica 34, 47\u201366 (2002)","journal-title":"Algorithmica"},{"key":"1098_CR36","doi-asserted-by":"crossref","unstructured":"Lissovoi, A., Oliveto, P.S., Warwicker, J.A.: On the time complexity of algorithm selection hyper-heuristics for multimodal optimisation. In: Conference on Artificial Intelligence, AAAI 2019, pp. 2322\u20132329. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33012322"},{"key":"1098_CR37","unstructured":"M\u00fchlenbein, H.: How genetic algorithms really work: mutation and hillclimbing. In: Parallel Problem Solving from Nature, PPSN 1992, pp. 15\u201326. Elsevier (1992)"},{"key":"1098_CR38","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tcs.2006.11.002","volume":"378","author":"F Neumann","year":"2007","unstructured":"Neumann, F., Wegener, I.: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. 378, 32\u201340 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"1098_CR39","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s11047-021-09841-7","volume":"20","author":"F Quinzan","year":"2021","unstructured":"Quinzan, F., G\u00f6bel, A., Wagner, M., Friedrich, T.: Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations. Nat. Comput. 20, 561\u2013575 (2021)","journal-title":"Nat. Comput."},{"key":"1098_CR40","doi-asserted-by":"crossref","unstructured":"Rowe, J.E., Aishwaryaprajna: The benefits and limitations of voting mechanisms in evolutionary optimisation. In: Foundations of Genetic Algorithms, FOGA 2019, pp. 34\u201342. ACM (2019)","DOI":"10.1145\/3299904.3340305"},{"key":"1098_CR41","unstructured":"Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kov\u01cec (1997)"},{"key":"1098_CR42","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Self-adjusting evolutionary algorithms for multimodal optimization. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1314\u20131322. ACM (2020)","DOI":"10.1145\/3377930.3389833"},{"key":"1098_CR43","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Stagnation detection in highly multimodal fitness landscapes. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1178\u20131186. ACM (2021)","DOI":"10.1145\/3449639.3459336"},{"key":"1098_CR44","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Stagnation detection with randomized local search. In: Evolutionary Computation in Combinatorial Optimization, EvoCOP 2021, pp. 152\u2013168. Springer (2021)","DOI":"10.1007\/978-3-030-72904-2_10"},{"key":"1098_CR45","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1214\/aoms\/1177731092","volume":"16","author":"A Wald","year":"1945","unstructured":"Wald, A.: Some generalizations of the theory of cumulative sums of random variables. Ann. Math. Stat. 16, 287\u2013293 (1945)","journal-title":"Ann. Math. Stat."},{"key":"1098_CR46","doi-asserted-by":"crossref","unstructured":"Witt, C.: Worst-case and average-case approximations by simple randomized search heuristics. In: Symposium on Theoretical Aspects of Computer Science, STACS 2005, pp. 44\u201356. Springer (2005)","DOI":"10.1007\/978-3-540-31856-9_4"},{"key":"1098_CR47","first-page":"65","volume":"14","author":"C Witt","year":"2006","unstructured":"Witt, C.: Runtime analysis of the ($$\\mu $$ + 1) EA on simple pseudo-Boolean functions. Evol. Comput. 14, 65\u201386 (2006)","journal-title":"Evol. Comput."},{"key":"1098_CR48","doi-asserted-by":"crossref","unstructured":"Witt, C.: On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms. In: Foundations of Genetic Algorithms, FOGA 2021, pp. 2:1\u20132:15. ACM (2021)","DOI":"10.1145\/3450218.3477303"},{"key":"1098_CR49","doi-asserted-by":"crossref","unstructured":"Wu, M., Qian, C., Tang, K.: Dynamic mutation based Pareto optimization for subset selection. In: Intelligent Computing Methodologies, ICIC 2018, Part III, pp. 25\u201335. Springer (2018)","DOI":"10.1007\/978-3-319-95957-3_4"},{"key":"1098_CR50","doi-asserted-by":"crossref","unstructured":"Whitley, D., Varadarajan, S., Hirsch, R., Mukhopadhyay, A.: Exploration and exploitation without mutation: solving the jump function in $${\\Theta (n)}$$ time. In: Parallel Problem Solving from Nature, PPSN 2018, Part II, pp. 55\u201366. Springer (2018)","DOI":"10.1007\/978-3-319-99259-4_5"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01098-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-023-01098-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01098-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T22:17:47Z","timestamp":1728944267000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-023-01098-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,22]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1098"],"URL":"https:\/\/doi.org\/10.1007\/s00453-023-01098-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2023,2,22]]},"assertion":[{"value":"25 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}