default search action
Arina Buzdalova
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j2]Wouter Heyndrickx, Lewis H. Mervin, Tobias Morawietz, Noé Sturm, Lukas Friedrich, Adam Zalewski, Anastasia Pentina, Lina Humbeck, Martijn Oldenhof, Ritsuya Niwayama, Peter Schmidtke, Nikolas Fechner, Jaak Simm, Adam Arany, Nicolas Drizard, Rama Jabal, Arina Afanasyeva, Regis Loeb, Shlok Verma, Simon Harnqvist, Matthew Holmes, Balazs Pejo, Maria Telenczuk, Nicholas Holway, Arne Dieckmann, Nicola Rieke, Friederike Zumsande, Djork-Arné Clevert, Michael Krug, Christopher N. Luscombe, Darren V. S. Green, Peter Ertl, Peter Antal, David Marcus, Nicolas Do Huu, Hideyoshi Fuji, Stephen D. Pickett, Gergely Ács, Eric Boniface, Bernd Beck, Yax Sun, Arnaud Gohier, Friedrich Rippmann, Ola Engkvist, Andreas H. Göller, Yves Moreau, Mathieu N. Galtier, Ansgar Schuffenhauer, Hugo Ceulemans:
MELLODDY: Cross-pharma Federated Learning at Unprecedented Scale Unlocks Benefits in QSAR without Compromising Proprietary Information. J. Chem. Inf. Model. 64(7): 2331-2344 (2024) - 2015
- [j1]Arina Afanasyeva, Sergey Izmailov, Michel Grigoriev, Michael Petukhov:
AquaBridge: A novel method for systematic search of structural water molecules within the protein active sites. J. Comput. Chem. 36(26): 1973-1977 (2015)
Conference and Workshop Papers
- 2022
- [c30]Nina Bulanova, Arina Buzdalova, Carola Doerr:
Fast Re-Optimization of LeadingOnes with Frequent Changes. CEC 2022: 1-8 - 2021
- [c29]Kirill Antonov, Maxim Buzdalov, Arina Buzdalova, Carola Doerr:
Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms. CEC 2021: 878-885 - 2020
- [c28]Arina Buzdalova, Carola Doerr, Anna Rodionova:
Hybridizing the 1/5-th Success Rule with Q-Learning for Controlling the Mutation Rate of an Evolutionary Algorithm. PPSN (2) 2020: 485-499 - 2019
- [c27]Anna Rodionova, Kirill Antonov, Arina Buzdalova, Carola Doerr:
Offspring population size matters when comparing evolutionary algorithms with self-adjusting mutation rates. GECCO 2019: 855-863 - [c26]Ivan Ignashov, Arina Buzdalova, Maxim Buzdalov, Carola Doerr:
Illustrating the trade-off between time, quality, and success probability in heuristic search: a discussion paper. GECCO (Companion) 2019: 1807-1812 - [c25]Dmitry Vinokurov, Maxim Buzdalov, Arina Buzdalova, Benjamin Doerr, Carola Doerr:
Fixed-target runtime analysis of the (1 + 1) EA with resampling. GECCO (Companion) 2019: 2068-2071 - 2018
- [c24]Denis Antipov, Arina Buzdalova, Andrew Stankevich:
Runtime analysis of a population-based evolutionary algorithm with auxiliary objectives selected by reinforcement learning. GECCO (Companion) 2018: 1886-1889 - 2017
- [c23]Denis Antipov, Arina Buzdalova:
Runtime Analysis of Random Local Search on JUMP function with Reinforcement Based Selection of Auxiliary Objectives. CEC 2017: 2169-2176 - [c22]Anton O. Bassin, Arina Buzdalova:
Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier. EvoCOP 2017: 173-188 - [c21]Irina Petrova, Arina Buzdalova:
Reinforcement learning based dynamic selection of auxiliary objectives with preservation of the best found solution. GECCO (Companion) 2017: 1435-1438 - 2016
- [c20]Nina Bulanova, Arina Buzdalova, Maxim Buzdalov:
Fitness-Dependent Hybridization of Clonal Selection Algorithm and Random Local Search. GECCO (Companion) 2016: 5-6 - [c19]Arkady Rost, Irina Petrova, Arina Buzdalova:
Adaptive Parameter Selection in Evolutionary Algorithms by Reinforcement Learning with Dynamic Discretization of Parameter Range. GECCO (Companion) 2016: 141-142 - [c18]Arina Buzdalova, Irina Petrova, Maxim Buzdalov:
Runtime analysis of different Approaches to select conflicting auxiliary objectives in the generalized OneMax problem. SSCI 2016: 1-7 - 2015
- [c17]Maxim Buzdalov, Arina Buzdalova:
Can OneMax help optimizing LeadingOnes using the EA+RL method? CEC 2015: 1762-1768 - [c16]Maxim Buzdalov, Arina Buzdalova:
Analysis of Q-learning with random exploration for selection of auxiliary objectives in random local search. CEC 2015: 1776-1783 - [c15]Arina Buzdalova, Anna Matveeva, Georgiy Korneev:
Selection of Auxiliary Objectives with Multi-Objective Reinforcement Learning. GECCO (Companion) 2015: 1177-1180 - [c14]Irina Petrova, Arina Buzdalova:
Selection of Auxiliary Objectives in the Travelling Salesman Problem using Reinforcement Learning. GECCO (Companion) 2015: 1455-1456 - 2014
- [c13]Maxim Buzdalov, Arina Buzdalova:
Onemax helps optimizing XdivK: : theoretical runtime analysis for RLS and EA+RL. GECCO (Companion) 2014: 201-202 - [c12]Arina Buzdalova, Vladislav Kononov, Maxim Buzdalov:
Selecting evolutionary operators using reinforcement learning: initial explorations. GECCO (Companion) 2014: 1033-1036 - [c11]Maxim Buzdalov, Irina Petrova, Arina Buzdalova:
NSGA-II implementation details may influence quality of solutions for the job-shop scheduling problem. GECCO (Companion) 2014: 1445-1446 - [c10]Irina Petrova, Arina Buzdalova, Maxim Buzdalov:
Improved Selection of Auxiliary Objectives Using Reinforcement Learning in Non-stationary Environment. ICMLA 2014: 580-583 - [c9]Arina Buzdalova, Maxim Buzdalov:
A New Algorithm for Adaptive Online Selection of Auxiliary Objectives. ICMLA 2014: 584-587 - 2013
- [c8]Maxim Buzdalov, Arina Buzdalova:
Adaptive selection of helper-objectives for test case generation. IEEE Congress on Evolutionary Computation 2013: 2245-2250 - [c7]Maxim Buzdalov, Arina Buzdalova, Irina Petrova:
Generation of tests for programming challenge tasks using multi-objective optimization. GECCO (Companion) 2013: 1655-1658 - [c6]Maxim Buzdalov, Arina Buzdalova, Anatoly Shalyto:
A First Step towards the Runtime Analysis of Evolutionary Algorithm Adjusted with Reinforcement Learning. ICMLA (1) 2013: 203-208 - [c5]Irina Petrova, Arina Buzdalova, Maxim Buzdalov:
Improved Helper-Objective Optimization Strategy for Job-Shop Scheduling Problem. ICMLA (2) 2013: 374-377 - [c4]Arina Buzdalova, Maxim Buzdalov, Vladimir Parfenov:
Generation of Tests for Programming Challenge Tasks Using Helper-Objectives. SSBSE 2013: 300-305 - 2012
- [c3]Arina Buzdalova, Maxim Buzdalov:
Adaptive Selection of Helper-Objectives with Reinforcement Learning. ICMLA (2) 2012: 66-67 - [c2]Arina Buzdalova, Maxim Buzdalov:
Increasing Efficiency of Evolutionary Algorithms by Choosing between Auxiliary Fitness Functions with Reinforcement Learning. ICMLA (1) 2012: 150-155 - 2011
- [c1]Arina Afanasyeva, Maxim Buzdalov:
Choosing Best Fitness Function with Reinforcement Learning. ICMLA (2) 2011: 354-357
Informal and Other Publications
- 2022
- [i6]Nina Bulanova, Arina Buzdalova, Carola Doerr:
Fast Re-Optimization of LeadingOnes with Frequent Changes. CoRR abs/2209.04391 (2022) - 2021
- [i5]Kirill Antonov, Maxim Buzdalov, Arina Buzdalova, Carola Doerr:
Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms. CoRR abs/2102.11461 (2021) - 2020
- [i4]Arina Buzdalova, Carola Doerr, Anna Rodionova:
Hybridizing the 1/5-th Success Rule with Q-Learning for Controlling the Mutation Rate of an Evolutionary Algorithm. CoRR abs/2006.11026 (2020) - 2019
- [i3]Anna Rodionova, Kirill Antonov, Arina Buzdalova, Carola Doerr:
Offspring Population Size Matters when Comparing Evolutionary Algorithms with Self-Adjusting Mutation Rates. CoRR abs/1904.08032 (2019) - 2017
- [i2]Irina Petrova, Arina Buzdalova:
Reinforcement Learning Based Dynamic Selection of Auxiliary Objectives with Preserving of the Best Found Solution. CoRR abs/1704.07187 (2017) - 2016
- [i1]Arkady Rost, Irina Petrova, Arina Buzdalova:
Adaptive Parameter Selection in Evolutionary Algorithms by Reinforcement Learning with Dynamic Discretization of Parameter Range. CoRR abs/1603.06788 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint