default search action
Anezka Kazikova
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c14]Tomas Kadavy, Adam Viktorin, Anezka Kazikova, Michal Pluhacek, Roman Senkerik:
Impact of Boundary Control Methods on Bound-constrained Optimization Benchmarking. GECCO Companion 2023: 25-26 - [c13]Michal Pluhacek, Anezka Kazikova, Tomas Kadavy, Adam Viktorin, Roman Senkerik:
Leveraging Large Language Models for the Generation of Novel Metaheuristic Optimization Algorithms. GECCO Companion 2023: 1812-1820 - [c12]Michal Pluhacek, Anezka Kazikova, Adam Viktorin, Tomas Kadavy, Roman Senkerik:
Investigating the Potential of AI-Driven Innovations for Enhancing Differential Evolution in Optimization Tasks. SMC 2023: 1070-1075 - 2022
- [j2]Tomas Kadavy, Adam Viktorin, Anezka Kazikova, Michal Pluhacek, Roman Senkerik:
Impact of Boundary Control Methods on Bound-Constrained Optimization Benchmarking. IEEE Trans. Evol. Comput. 26(6): 1271-1280 (2022) - [c11]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Anezka Kazikova, Roman Senkerik:
Exploring clustering in SOMA. COMPENG 2022: 1-5 - [c10]Michal Pluhacek, Tomas Kadavy, Anezka Kazikova, Adam Viktorin, Roman Senkerik:
Inner Dynamics of Particle Swarm Optimization Interpreted by Complex Network Analysis. COMPENG 2022: 1-5 - 2021
- [j1]Anezka Kazikova, Michal Pluhacek, Roman Senkerik:
How Does the Number of Objective Function Evaluations Impact Our Understanding of Metaheuristics Behavior? IEEE Access 9: 44032-44048 (2021) - [c9]Michal Pluhacek, Anezka Kazikova, Tomas Kadavy, Adam Viktorin, Roman Senkerik:
Explaining SOMA: the relation of stochastic perturbation to population diversity and parameter space coverage. GECCO Companion 2021: 1944-1952 - [c8]Michal Pluhacek, Adam Viktorin, Tomas Kadavy, Anezka Kazikova:
On the common population diversity measures in metaheuristics and their limitations. SSCI 2021: 1-7 - 2020
- [c7]Anezka Kazikova, Krystian Lapa, Michal Pluhacek, Roman Senkerik:
Cascade PID Controller Optimization Using Bison Algorithm. ICAISC (1) 2020: 406-416
2010 – 2019
- 2019
- [c6]Anezka Kazikova, Zuzana Komínková Oplatková, Michal Pluhacek, Roman Senkerik:
Border Strategies Of The Bison Algorithm. ECMS 2019: 43-49 - [c5]Roman Senkerik, Adam Viktorin, Tomas Kadavy, Michal Pluhacek, Anezka Kazikova, Quoc Bao Diep, Ivan Zelinka:
Population Diversity Analysis in Adaptive Differential Evolution Variants with Unconventional Randomization Schemes. ICAISC (1) 2019: 506-518 - 2018
- [c4]Anezka Kazikova, Michal Pluhacek, Roman Senkerik:
Performance of the Bison Algorithm on Benchmark IEEE CEC 2017. CSOS (2) 2018: 445-454 - [c3]Anezka Kazikova, Michal Pluhacek, Roman Senkerik:
Tuning Of The Bison Algorithm Control Parameter. ECMS 2018: 156-162 - [c2]Anezka Kazikova, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
New Running Technique for the Bison Algorithm. ICAISC (1) 2018: 417-426 - 2017
- [c1]Anezka Kazikova, Michal Pluhacek, Roman Senkerik, Adam Viktorin:
Proposal of a New Swarm Optimization Method Inspired in Bison Behavior. MENDEL 2017: 146-156
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-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint