3 papers
cs.NE2022
Fast Re-Optimization of LeadingOnes with Frequent Changes
Nina Bulanova, Arina Buzdalova, Carola Doerr
In real-world optimization scenarios, the problem instance that we are asked to solve may change during the optimization process, e.g., when new information becomes available or wh…
cs.NE2019
Black-Box Complexity of the Binary Value Function
Nina Bulanova, Maxim Buzdalov
The binary value function, or BinVal, has appeared in several studies in theory of evolutionary computation as one of the extreme examples of linear pseudo-Boolean functions. Its u…
cs.NE2018
Better Fixed-Arity Unbiased Black-Box Algorithms
Nina Bulanova, Maxim Buzdalov
In their GECCO'12 paper, Doerr and Doerr proved that the -ary unbiased black-box complexity of OneMax on bits is for . We propose an alternativ…