( en | de | ru )

 

Disambiguation of "Lissovoi, Andrei"

Author of the publication

copydeleteadd this publication to your clipboard
Hyper-heuristics Can Achieve Optimal Performance for Pseudo-Boolean Optimisation.

, , and . CoRR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrei Negoescu

Andrei Lehmann

Andrei Belitski

Andrei Verbovsky

Andrei Munk

 

Other publications of authors with the same name

On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions., and . AAAI, page 1363-1370. AAAI Press, (2018)Computational Complexity Analysis of Genetic Programming., and . Theory of Evolutionary Computation, Springer, (2020)Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes*., , and . Evol. Comput., 28 (3): 437-461 (2020)On the runtime analysis of selection hyper-heuristics with adaptive learning periods., , , and . GECCO, page 1015-1022. ACM, (2018)Evolving boolean functions with conjunctions and disjunctions via genetic programming., , and . GECCO, page 1003-1011. ACM, (2019)On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation., , and . AAAI, page 2322-2329. AAAI Press, (2019)Analysis of Ant Colony Optimization and Population-Based Evolutionary Algorithms on Dynamic Problems.. Technical University of Denmark, (2016)Computational Complexity Analysis of Genetic Programming., and . CoRR, (2018)How the Duration of the Learning Period Affects the Performance of Random Gradient Selection Hyper-Heuristics., , and . AAAI, page 2376-2383. AAAI Press, (2020)Hyper-heuristics Can Achieve Optimal Performance for Pseudo-Boolean Optimisation., , and . CoRR, (2018)