default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam Viktorin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c106]Adam Viktorin
, Michal Pluhacek, Tomas Kadavy, Jozef Kovác, Peter Janku, Roman Senkerik:
DISH Solving the GNBG-generated Test Suite. GECCO Companion 2024: 19-20- [c105]Michal Pluhacek, Adam Viktorin, Tomas Kadavy, Jozef Kovác, Roman Senkerik:
Measuring Population Diversity in Variable Dimension Search Spaces. GECCO Companion 2024: 1511-1519 - [c104]Michal Pluhacek, Jozef Kovác, Peter Janku, Tomas Kadavy, Roman Senkerik, Adam Viktorin:
A Critical Examination of Large Language Model Capabilities in Iteratively Refining Differential Evolution Algorithm. GECCO Companion 2024: 1855-1862 - [c103]Michal Pluhacek, Jozef Kovác, Adam Viktorin, Peter Janku, Tomas Kadavy, Roman Senkerik:
Using LLM for Automatic Evolvement of Metaheuristics from Swarm Algorithm SOMA. GECCO Companion 2024: 2018-2022 - 2023
- [j9]Adam Viktorin, Dusan Hrabec, Vlastimír Nevrlý, Radovan Somplák, Roman Senkerik:
Hierarchical clustering-based algorithms for optimal waste collection point locations in large-scale problems: A framework development and case study. Comput. Ind. Eng. 178: 109142 (2023) - [c102]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 - [c101]Marcela Matusikova, Michal Pluhacek, Tomas Kadavy, Adam Viktorin, Roman Senkerik:
Exploring Adaptive Components of SOMA. GECCO Companion 2023: 1803-1811 - [c100]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 - [c99]Roman Senkerik, Tomas Kadavy, Peter Janku, Michal Pluhacek, Hubert Guzowski, Libor Pekar, Radek Matusu, Adam Viktorin, Maciej Smolka, Aleksander Byrski, Zuzana Komínková Oplatková:
Maximizing Efficiency: A Comparative Study of SOMA Algorithm Variants and Constraint Handling Methods for Time Delay System Optimization. GECCO Companion 2023: 1821-1829 - [c98]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Exploring the Frequency of Boundary Control Methods Activation in Metaheuristic Algorithms. GECCO Companion 2023: 2330-2336 - [c97]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 - [c96]Roman Senkerik, Aleksander Byrski, Hubert Guzowski, Peter Janku, Tomas Kadavy, Zuzana Komínková Oplatková, Radek Matusu, Michal Pluhacek, Libor Pekar, Maciej Smolka, Adam Viktorin:
Efficient Time-Delay System Optimization with Auto-Configured Metaheuristics. SMC 2023: 1084-1089 - 2022
- [j8]Arka Ghosh, Swagatam Das, Asit Kumar Das, Roman Senkerik, Adam Viktorin, Ivan Zelinka, Antonio David Masegosa:
Using spatial neighborhoods for parameter adaptation: An improved success history based differential evolution. Swarm Evol. Comput. 71: 101057 (2022) - [j7]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) - [c95]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Anezka Kazikova, Roman Senkerik:
Exploring clustering in SOMA. COMPENG 2022: 1-5 - [c94]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
- [j6]Tomas Kadavy, Roman Senkerik, Michal Pluhacek, Adam Viktorin:
Orthogonal Learning Firefly Algorithm. Log. J. IGPL 29(2): 167-179 (2021) - [c93]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
SOMA-CLP for competition on bound constrained single objective numerical optimization benchmark: a competition entry on bound constrained single objective numerical optimization at the genetic and evolutionary computation conference (GECCO) 2021. GECCO Companion 2021: 11-12 - [c92]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Self-organizing migrating algorithm with clustering-aided migration and adaptive perturbation vector control. GECCO Companion 2021: 1916-1922 - [c91]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 - [c90]Tomas Kadavy, Adam Viktorin, Michal Pluhacek, Stanislav Kovar:
On Modifications Towards Improvement of the Exploitation Phase for SOMA Algorithm with Clustering-aided Migration and Adaptive Perturbation Vector Control. SSCI 2021: 1-8 - [c89]Michal Pluhacek, Adam Viktorin, Tomas Kadavy, Anezka Kazikova:
On the common population diversity measures in metaheuristics and their limitations. SSCI 2021: 1-7 - [c88]Adam Ulrich, Adam Viktorin, Michal Pluhacek, Tomas Kadavy, Jan Krnávek:
Novelty Search in Particle Swarm Optimization. SSCI 2021: 1-8 - 2020
- [j5]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
Analysing knowledge transfer in SHADE via complex network. Log. J. IGPL 28(2): 153-170 (2020) - [j4]Michal Pluhacek, Adam Viktorin, Roman Senkerik, Tomas Kadavy, Ivan Zelinka:
Extended experimental study on PSO with partial population restart based on complex network analysis. Log. J. IGPL 28(2): 211-225 (2020) - [j3]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Tomas Kadavy:
Chaos-enhanced multiple-choice strategy for particle swarm optimisation. Int. J. Parallel Emergent Distributed Syst. 35(6): 603-616 (2020) - [c87]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy, Ales Zamuda:
DISH-XX Solving CEC2020 Single Objective Bound Constrained Numerical optimization Benchmark. CEC 2020: 1-8 - [c86]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
SOMA-CL for competition on single objective bound constrained numerical optimization benchmark: a competition entry on single objective bound constrained numerical optimization at the genetic and evolutionary computation conference (GECCO) 2020. GECCO Companion 2020: 9-10 - [c85]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Self-organizing migrating algorithm with clustering-aided migration. GECCO Companion 2020: 1441-1447 - [c84]Roman Senkerik, Tomas Kadavy, Adam Viktorin, Michal Pluhacek:
Ensemble of strategies and perturbation parameter based SOMA for optimal stabilization of chaotic oscillations. GECCO Companion 2020: 1468-1475 - [c83]Roman Senkerik, Adam Viktorin, Tomas Kadavy, Michal Pluhacek, Ivan Zelinka:
Is Chaotic Randomization Advantageous for Higher Dimensional Optimization Problems? ICAISC (2) 2020: 423-434
2010 – 2019
- 2019
- [j2]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy, Ales Zamuda:
Distance based parameter adaptation for Success-History based Differential Evolution. Swarm Evol. Comput. 50 (2019) - [c82]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy, Ales Zamuda:
DISH Algorithm Solving the CEC 2019 100-Digit Challenge. CEC 2019: 1-6 - [c81]Tomas Kadavy, Michal Pluhacek, Roman Senkerik, Adam Viktorin:
The Ensemble of Strategies and Perturbation Parameter in Self-organizing Migrating Algorithm Solving CEC 2019 100-Digit Challenge. CEC 2019: 372-375 - [c80]Roman Senkerik, Tomas Kadavy, Adam Viktorin, Michal Pluhacek:
Ensemble of Strategies and Perturbation Parameter Based SOMA for Constrained Technological Design Optimization Problem. CEC 2019: 2872-2877 - [c79]Tomas Kadavy, Michal Pluhacek, Roman Senkerik, Adam Viktorin:
Introducing Self-Adaptive Parameters to Self-organizing Migrating Algorithm. CEC 2019: 2908-2914 - [c78]Tomas Kadavy, Stanislav Kovar, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Evolutionary Algorithms Applied to a Shielding Enclosure Design. ICAISC (1) 2019: 445-455 - [c77]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 - [c76]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
Analyzing Control Parameters in DISH. ICAISC (1) 2019: 519-529 - [c75]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Tomas Kadavy:
Self-organizing Migrating Algorithm with Non-binary Perturbation. SEMCCO/FANCCO 2019: 43-57 - [c74]Tomas Kadavy, Michal Pluhacek, Roman Senkerik, Adam Viktorin:
Boundary Strategies for Self-organizing Migrating Algorithm Analyzed Using CEC'17 Benchmark. SEMCCO/FANCCO 2019: 58-69 - [c73]Roman Senkerik, Adam Viktorin, Tomas Kadavy, Michal Pluhacek, Ivan Zelinka:
Insight into Adaptive Differential Evolution Variants with Unconventional Randomization Schemes. SEMCCO/FANCCO 2019: 177-188 - [p1]Simone Spolaor, Marco Gribaudo, Mauro Iacono, Tomas Kadavy, Zuzana Komínková Oplatková, Giancarlo Mauri, Sabri Pllana, Roman Senkerik, Natalija Stojanovic, Esko Turunen, Adam Viktorin, Salvatore Vitabile, Ales Zamuda, Marco S. Nobile:
Towards Human Cell Simulation. High-Performance Modelling and Simulation for Big Data Applications 2019: 221-249 - 2018
- [j1]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
Modified progressive random walk with chaotic PRNG. Int. J. Parallel Emergent Distributed Syst. 33(5): 450-459 (2018) - [c72]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Comparing Boundary Control Methods for Firefly Algorithm. BIOMA 2018: 163-173 - [c71]Roman Senkerik, Adam Viktorin, Michal Pluhacek, Tomas Kadavy:
Population Diversity Analysis for the Chaotic Based Selection of Individuals in Differential Evolution. BIOMA 2018: 283-294 - [c70]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
How Distance Based Parameter Adaptation Affects Population Diversity. BIOMA 2018: 307-319 - [c69]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Tomas Kadavy, Ivan Zelinka:
Chaos Driven PSO with Attractive Search Space Border Points. CEC 2018: 1-6 - [c68]Roman Senkerik, Adam Viktorin, Michal Pluhacek, Tomas Kadavy:
On the Population Diversity for the Chaotic Differential Evolution. CEC 2018: 1-8 - [c67]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
Cluster Occurrence in the DbL_SHADE Population. CEC 2018: 1-8 - [c66]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
Distance vs. Improvement Based Parameter Adaptation in SHADE. CSOS (2) 2018: 455-464 - [c65]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Firefly Algorithm Enhanced by Orthogonal Learning. CSOS (2) 2018: 477-488 - [c64]Roman Senkerik, Adam Viktorin, Michal Pluhacek, Tomas Kadavy, Zuzana Komínková Oplatková:
On the Applicability of Random and the Best Solution Driven Metaheuristics for Analytic Programming and Time Series Regression. CSOS (2) 2018: 489-498 - [c63]Zuzana Komínková Oplatková, Adam Viktorin, Roman Senkerik:
Pseudo Neural Networks Via Analytic Programming With Direct Coding Of Constant Estimation. ECMS 2018: 143-149 - [c62]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Tomas Kadavy:
Study On Velocity Clamping In PSO Using CEC'13 Benchmark. ECMS 2018: 150-155 - [c61]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
Comparative Study Of The Distance/Improvement Based SHADE. ECMS 2018: 163-169 - [c60]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Boundary Strategies For Firefly Algorithm Analysed Using CEC'17 Benchmark. ECMS 2018: 170-175 - [c59]Roman Senkerik, Michal Pluhacek, Adam Viktorin, Tomas Kadavy, Jakub Janostik, Zuzana Komínková Oplatková:
A Review On The Simulation of Social Networks Inside Heuristic Algorithms. ECMS 2018: 176-182 - [c58]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Orthogonal Learning Firefly Algorithm. HAIS 2018: 315-326 - [c57]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Multi-swarm Optimization Algorithm Based on Firefly and Particle Swarm Optimization Techniques. ICAISC (1) 2018: 405-416 - [c56]Anezka Kazikova, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
New Running Technique for the Bison Algorithm. ICAISC (1) 2018: 417-426 - [c55]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Tomas Kadavy:
Particle Swarm Optimization with Single Particle Repulsivity for Multi-modal Optimization. ICAISC (1) 2018: 486-494 - [c54]Roman Senkerik, Adam Viktorin, Michal Pluhacek, Tomas Kadavy, Ivan Zelinka:
How Unconventional Chaotic Pseudo-Random Generators Influence Population Diversity in Differential Evolution. ICAISC (1) 2018: 524-535 - [c53]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
On the Prolonged Exploration of Distance Based Parameter Adaptation in SHADE. ICAISC (1) 2018: 561-571 - [c52]Zuzana Komínková Oplatková, Roman Senkerik, Adam Viktorin:
Differential Evolution and Analytic Programming in the case of Trigonometric Identities Discovery. IWSSIP 2018: 1-5 - [c51]Roman Senkerik, Adam Viktorin, Michal Pluhacek, Tomas Kadavy, Zuzana Komínková Oplatková:
Differential Evolution and Chaotic Series. IWSSIP 2018: 1-5 - [c50]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
Addressing Premature Convergence with Distance based Parameter Adaptation in SHADE. IWSSIP 2018: 1-5 - [c49]Tomas Kadavy, Michal Pluhacek, Roman Senkerik, Adam Viktorin:
On the Performance Significance of Boundary Strategies for Firefly Algorithm. SSCI 2018: 765-769 - [c48]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Tomas Kadavy:
Why Simple Population Restart Does Not Work in PSO. SSCI 2018: 770-776 - 2017
- [c47]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
Towards Better Population Sizing for Differential Evolution Through Active Population Analysis with Complex Network. CISIS 2017: 225-235 - [c46]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
SHADE Algorithm Dynamic Analyzed Through Complex Network. COCOON 2017: 666-677 - [c45]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
The Influence of Archive Size to SHADE. CSOC (1) 2017: 517-527 - [c44]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Comparing Border Strategies for Roaming Particles on Single and Multi-swarm PSO. CSOC (1) 2017: 528-536 - [c43]Roman Senkerik, Michal Pluhacek, Adam Viktorin, Tomas Kadavy:
On the Randomization of Indices Selection for Differential Evolution. CSOC (1) 2017: 537-547 - [c42]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
SHADE Mutation Strategy Analysis Via Dynamic Simulation In Complex Network. ECMS 2017: 299-305 - [c41]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Tomas Kadavy:
Uncovering Communication Density In PSO Using Complex Network. ECMS 2017: 306-312 - [c40]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Firework Algorithm Dynamics Simulated And Analyzed With The Aid Of Complex Network. ECMS 2017: 313-318 - [c39]Roman Senkerik, Michal Pluhacek, Adam Viktorin, Zuzana Komínková Oplatková, Tomas Kadavy:
Simulation Of Chaotic Dynamics For Chaos Based Optimization - An Extended Study. ECMS 2017: 319-325 - [c38]Zuzana Komínková Oplatková, Adam Viktorin, Roman Senkerik, Tomás Urbánek:
Different Approaches For Constant Estimation In Analytic Programming. ECMS 2017: 326-332 - [c37]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Hypersphere Universe Boundary Method Comparison on HCLPSO and PSO. HAIS 2017: 173-182 - [c36]Michal Pluhacek, Adam Viktorin, Roman Senkerik, Tomas Kadavy, Ivan Zelinka:
PSO with Partial Population Restart Based on Complex Network Analysis. HAIS 2017: 183-192 - [c35]Adam Viktorin, Michal Pluhacek, Roman Senkerik, Tomas Kadavy:
Detecting Potential Design Weaknesses in SHADE Through Network Feature Analysis. HAIS 2017: 662-673 - [c34]Roman Senkerik, Adam Viktorin, Michal Pluhacek, Tomas Kadavy, Ivan Zelinka:
Hybridization of Analytic Programming and Differential Evolution for Time Series Prediction. HAIS 2017: 686-698 - [c33]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Comparing Strategies for Search Space Boundaries Violation in PSO. ICAISC (2) 2017: 655-664 - [c32]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Tomas Kadavy:
PSO with Attractive Search Space Border Points. ICAISC (2) 2017: 665-675 - [c31]Roman Senkerik, Adam Viktorin, Michal Pluhacek, Tomas Kadavy, Ivan Zelinka:
Differential Evolution Driven Analytic Programming for Prediction. ICAISC (2) 2017: 676-687 - [c30]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
Archive Analysis in SHADE. ICAISC (2) 2017: 688-699 - [c29]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy:
Enhanced Archive for SHADE. MENDEL 2017: 40-55 - [c28]Zuzana Komínková Oplatková, Adam Viktorin, Roman Senkerik:
Comparison of Three Novelty Approaches to Constants (Ks) Handling in Analytic Programming Powered by SHADE. MENDEL 2017: 134-145 - [c27]Anezka Kazikova, Michal Pluhacek, Roman Senkerik, Adam Viktorin:
Proposal of a New Swarm Optimization Method Inspired in Bison Behavior. MENDEL 2017: 146-156 - [c26]Roman Senkerik, Michal Pluhacek, Adam Viktorin, Tomas Kadavy, Zuzana Komínková Oplatková:
Randomization of Individuals Selection in Differential Evolution. MENDEL 2017: 180-191 - [c25]Tomas Kadavy, Michal Pluhacek, Adam Viktorin, Roman Senkerik:
Partial population restart of firefly algorithm using complex network analysis. SSCI 2017: 1-7 - [c24]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Tomas Kadavy:
Exploring the shortest path in PSO communication network. SSCI 2017: 1-6 - [c23]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Tomas Kadavy:
How chaotic sequences and generator sequencing affect the particle trajectory in PSO. SSCI 2017: 1-8 - [c22]Roman Senkerik, Adam Viktorin, Michal Pluhacek, Tomas Kadavy, Zuzana Komínková Oplatková:
Performance comparison of differential evolution driving analytic programming for regression. SSCI 2017: 1-8 - [c21]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Tomas Kadavy, Ales Zamuda:
Distance based parameter adaptation for differential evolution. SSCI 2017: 1-7 - 2016
- [c20]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Jakub Janostik, Donald Davendra:
Complex network analysis in PSO as an fitness landscape classifier. CEC 2016: 3332-3337 - [c19]Roman Senkerik, Adam Viktorin, Michal Pluhacek, Jakub Janostik, Donald Davendra:
On the influence of different randomization and complex network analysis for differential evolution. CEC 2016: 3346-3353 - [c18]Adam Viktorin, Michal Pluhacek, Roman Senkerik:
Success-history based adaptive differential evolution algorithm with multi-chaotic framework for parent selection performance on CEC2014 benchmark set. CEC 2016: 4797-4803 - [c17]Adam Viktorin, Michal Pluhacek, Roman Senkerik:
Lozi Map Generated Initial Population in Analytical Programming. CSOC (1) 2016: 297-306 - [c16]Roman Senkerik, Adam Viktorin, Michal Pluhacek, Jakub Janostik, Zuzana Komínková Oplatková:
Study on the Time Development of Complex Network for Metaheuristic. CSOC (1) 2016: 525-533 - [c15]Adam Viktorin, Michal Pluhacek, Zuzana Komínková Oplatková, Roman Senkerik:
Analytical Programming With Extended Individuals. ECMS 2016: 237-244 - [c14]Adam Viktorin, Dusan Hrabec, Michal Pluhacek:
Multi-Chaotic Differential Evolution For Vehicle Routing Problem With Profits. ECMS 2016: 245-251 - [c13]Michal Pluhacek, Roman Senkerik, Jakub Janostik, Adam Viktorin, Ivan Zelinka:
Study On Swarm Dynamics Converted Into Complex Network. ECMS 2016: 252-257 - [c12]Roman Senkerik, Michal Pluhacek, Adam Viktorin, Zuzana Komínková Oplatková:
On The Simulation Of Complex Chaotic Dynamics For Chaos Based Optimization. ECMS 2016: 258-264 - [c11]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Ivan Zelinka:
Multi-chaotic Approach for Particle Acceleration in PSO. HM 2016: 75-86 - [c10]Adam Viktorin, Roman Senkerik, Michal Pluhacek:
Hybridization of Chaotic Systems and Success-History Based Adaptive Differential Evolution. HM 2016: 145-156 - [c9]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Ivan Zelinka:
Chaos Enhanced Repulsive MC-PSO/DE Hybrid. ICAISC (1) 2016: 465-475 - [c8]Roman Senkerik, Michal Pluhacek, Ivan Zelinka, Adam Viktorin, Jakub Janostik:
Extended Study on the Randomization and Sequencing for the Chaos Embedded Heuristic. ICAISC (1) 2016: 493-504 - [c7]Adam Viktorin, Michal Pluhacek, Roman Senkerik:
Multi-chaotic System Induced Success-History Based Adaptive Differential Evolution. ICAISC (1) 2016: 517-527 - [c6]Adam Viktorin, Michal Pluhacek, Roman Senkerik:
Network Based Linear Population Size Reduction in SHADE. INCoS 2016: 86-93 - [c5]Michal Pluhacek, Roman Senkerik, Adam Viktorin, Ivan Zelinka:
Creating Complex Networks Using Multi-swarm PSO. INCoS 2016: 180-185 - [c4]Roman Senkerik, Adam Viktorin, Michal Pluhacek:
On the Transforming of the Indices Selection Mechanism inside Differential Evolution into Complex Network. INCoS 2016: 186-192 - [c3]Roman Senkerik, Ivan Zelinka, Michal Pluhacek, Adam Viktorin:
Study on the Development of Complex Network for Evolutionary and Swarm Based Algorithms. MICAI (2) 2016: 151-161 - [c2]Michal Pluhacek, Tomas Kadavy, Roman Senkerik, Adam Viktorin, Ivan Zelinka:
Comparing selected PSO modifications on CEC 15 benchmark set. SSCI 2016: 1-6 - [c1]Adam Viktorin, Roman Senkerik, Michal Pluhacek, Ales Zamuda:
Steady success clusters in Differential Evolution. SSCI 2016: 1-8
Coauthor Index
[c106] [c105] [c104] [c103] [c102] [c101] [c100] [c99] [c98] [c97] [c96] [j7] [c95] [c94] [j6] [c93] [c92] [c91] [c90] [c89] [c88] [j5] [j4] [j3] [c87] [c86] [c85] [c84] [c83] [j2] [c82] [c81] [c80] [c79] [c78] [c77] [c76] [c75] [c74] [c73] [p1] [j1] [c72] [c71] [c70] [c69] [c68] [c67] [c66] [c65] [c64] [c62] [c61] [c60] [c59] [c58] [c57] [c55] [c54] [c53] [c51] [c50] [c49] [c48] [c47] [c46] [c45] [c44] [c43] [c42] [c41] [c40] [c39] [c37] [c36] [c35] [c34] [c33] [c32] [c31] [c30] [c29] [c26] [c25] [c24] [c23] [c22] [c21] [c2]
[c106] [c105] [c104] [c103] [c102] [c101] [c100] [c99] [c98] [c97] [c96] [j7] [c95] [c94] [j6] [c93] [c92] [c91] [c90] [c89] [c88] [j5] [j4] [j3] [c87] [c86] [c85] [c84] [c83] [j2] [c82] [c81] [c80] [c79] [c78] [c77] [c76] [c75] [c74] [c73] [j1] [c72] [c71] [c70] [c69] [c68] [c67] [c66] [c65] [c64] [c62] [c61] [c60] [c59] [c58] [c57] [c56] [c55] [c54] [c53] [c51] [c50] [c49] [c48] [c47] [c46] [c45] [c44] [c43] [c42] [c41] [c40] [c39] [c37] [c36] [c35] [c34] [c33] [c32] [c31] [c30] [c29] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [c20] [c19] [c18] [c17] [c16] [c15] [c14] [c13] [c12] [c11] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [c1]
[c106] [c105] [c104] [c103] [j9] [c102] [c101] [c100] [c99] [c98] [c97] [c96] [j8] [j7] [c95] [c94] [j6] [c93] [c92] [c91] [j5] [j4] [j3] [c87] [c86] [c85] [c84] [c83] [j2] [c82] [c81] [c80] [c79] [c78] [c77] [c76] [c75] [c74] [c73] [p1] [j1] [c72] [c71] [c70] [c69] [c68] [c67] [c66] [c65] [c64] [c63] [c62] [c61] [c60] [c59] [c58] [c57] [c56] [c55] [c54] [c53] [c52] [c51] [c50] [c49] [c48] [c47] [c46] [c45] [c44] [c43] [c42] [c41] [c40] [c39] [c38] [c37] [c36] [c35] [c34] [c33] [c32] [c31] [c30] [c29] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [c20] [c19] [c18] [c17] [c16] [c15] [c13] [c12] [c11] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [c1]
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:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
