{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:23:24Z","timestamp":1743146604877,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581145"},{"type":"electronic","value":"9783030581152"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58115-2_45","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"648-660","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved Fixed-Budget Results via Drift Analysis"],"prefix":"10.1007","author":[{"given":"Timo","family":"K\u00f6tzing","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6105-7700","authenticated-orcid":false,"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Doerr, B., Jansen, T., Witt, C., Zarges, C.: A method to derive fixed budget results from expected optimisation times. In: Proceedings of GECCO 2013, pp. 1581\u20131588. ACM Press (2013)","DOI":"10.1145\/2463372.2463565"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2019.06.014","volume":"801","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Doerr, C., Yang, J.: Optimal parameter choices via precise black-box analysis. Theor. Comput. Sci. 801, 1\u201334 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1214\/EJP.v20-3496","volume":"20","author":"X Fan","year":"2015","unstructured":"Fan, X., Grama, I., Liu, Q.: Exponential inequalities for martingales with applications. Electron. J. Probab. 20, 22 (2015)","journal-title":"Electron. J. Probab."},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Hall, G.T., Oliveto, P.S., Sudholt, D.: On the impact of the cutoff time on the performance of algorithm configurators. In: Proceedings of GECCO 2019, pp. 907\u2013915. ACM Press (2019)","DOI":"10.1145\/3321707.3321879"},{"key":"45_CR5","unstructured":"He, J., Jansen, T., Zarges, C.: Unlimited budget analysis of randomised search heuristics. CoRR, abs\/1909.03342 (2019). \nhttp:\/\/arxiv.org\/abs\/1909.03342"},{"key":"45_CR6","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-29414-4_5","volume-title":"Theory of Evolutionary Computation","author":"T Jansen","year":"2020","unstructured":"Jansen, T.: Analysing stochastic search heuristics operating on a fixed budget. Theory of Evolutionary Computation. NCS, pp. 249\u2013270. Springer, Cham (2020). \nhttps:\/\/doi.org\/10.1007\/978-3-030-29414-4_5"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Jansen, T., Zarges, C.: Fixed budget computations: a different perspective on run time analysis. In: Proceedings of GECCO 2012, pp. 1325\u20131332. ACM Press (2012)","DOI":"10.1145\/2330163.2330347"},{"issue":"5","key":"45_CR8","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1109\/TEVC.2014.2349160","volume":"18","author":"T Jansen","year":"2014","unstructured":"Jansen, T., Zarges, C.: Reevaluating immune-inspired hypermutations using the fixed budget perspective. IEEE Trans. Evol. Comput. 18(5), 674\u2013688 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"45_CR9","unstructured":"Johannsen, D.: Random combinatorial structures and randomized search heuristics. Ph.D. thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany and the Max-Planck-Institut f\u00fcr Informatik (2010)"},{"key":"45_CR10","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/s00453-015-0048-0","volume":"75","author":"T K\u00f6tzing","year":"2016","unstructured":"K\u00f6tzing, T.: Concentration of first hitting times under additive drift. Algorithmica 75, 490\u2013506 (2016)","journal-title":"Algorithmica"},{"key":"45_CR11","unstructured":"K\u00f6tzing, T., Witt, C.: Improved fixed-budget results via drift analysis (2020). \nhttp:\/\/arxiv.org\/abs\/2006.07019"},{"key":"45_CR12","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-29414-4_2","volume-title":"Theory of Evolutionary Computation","author":"J Lengler","year":"2020","unstructured":"Lengler, J.: Drift analysis. Theory of Evolutionary Computation. NCS, pp. 89\u2013131. Springer, Cham (2020). \nhttps:\/\/doi.org\/10.1007\/978-3-030-29414-4_2"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Lengler, J., Spooner, N.: Fixed budget performance of the (1+1) EA on linear functions. In: Proceedings of FOGA 2015, pp. 52\u201361. ACM Press (2015)","DOI":"10.1145\/2725494.2725506"},{"key":"45_CR14","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-662-12788-9_6","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","author":"C McDiarmid","year":"1998","unstructured":"McDiarmid, C.: Concentration. In: Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B. (eds.) Probabilistic Methods for Algorithmic Discrete Mathematics. Algorithms and Combinatorics, vol. 16, pp. 195\u2013247. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/978-3-662-12788-9_6"},{"issue":"4","key":"45_CR15","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1162\/evco_a_00199","volume":"25","author":"S Nallaperuma","year":"2017","unstructured":"Nallaperuma, S., Neumann, F., Sudholt, D.: Expected fitness gains of randomized search heuristics for the traveling salesperson problem. Evol. Comput. 25(4), 673\u2013705 (2017)","journal-title":"Evol. Comput."},{"key":"45_CR16","unstructured":"Wainwright, M.: Basic tail and concentration bounds. Technical report (2015). Lecture Notes, University of Berkeley. \nhttps:\/\/www.stat.berkeley.edu\/~mjwain\/stat210b\/Chap2_TailBounds_Jan22_2015.pdf"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58115-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:10:21Z","timestamp":1598998221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"268","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"99","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}