{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:27:56Z","timestamp":1725604076538},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7,18]]},"DOI":"10.1109\/cec55065.2022.9870400","type":"proceedings-article","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T19:28:14Z","timestamp":1662492494000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Fast Re-Optimization of LeadingOnes with Frequent Changes"],"prefix":"10.1109","author":[{"given":"Nina","family":"Bulanova","sequence":"first","affiliation":[{"name":"ITMO University,Saint Petersburg,Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arina","family":"Buzdalova","sequence":"additional","affiliation":[{"name":"ITMO University,Saint Petersburg,Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[{"name":"Sorbonne Université, CNRS, LIP6,Paris,France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Convergence Properties of Evolutionary Algorithms","year":"1997","author":"rudolph","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"journal-title":"Towards a more practice-aware runtime analysis of evolutionary algorithms","year":"2018","author":"pinto","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CEC45853.2021.9504752"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8790211"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58112-1_42"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4_7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459312"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72904-2_6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205563"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0187-y"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321731"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2012.05.001"},{"key":"ref9","article-title":"Analysing the robustness of evolutionary algorithms to noise: Refined runtime bounds and an example where noise is beneficial","author":"sudholt","year":"2020","journal-title":"Algorithmica"}],"event":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2022,7,18]]},"location":"Padua, Italy","end":{"date-parts":[[2022,7,23]]}},"container-title":["2022 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9870216\/9870201\/09870400.pdf?arnumber=9870400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T21:16:16Z","timestamp":1664226976000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9870400\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,18]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/cec55065.2022.9870400","relation":{},"subject":[],"published":{"date-parts":[[2022,7,18]]}}}