Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

An Experimental Method to Estimate Running Time of Evolutionary Algorithms for Continuous Optimization
Han Huang, Junpeng Su, Yushan Zhang, et al.
IEEE Transactions on Evolutionary Computation (2019) Vol. 24, Iss. 2, pp. 275-289
Closed Access | Times Cited: 21

Showing 21 citing articles:

A Recommender System for Metaheuristic Algorithms for Continuous Optimization Based on Deep Recurrent Neural Networks
Ye Tian, Shichen Peng, Xingyi Zhang, et al.
IEEE Transactions on Artificial Intelligence (2020) Vol. 1, Iss. 1, pp. 5-18
Closed Access | Times Cited: 62
Multi-objective multi-criteria evolutionary algorithm for multi-objective multi-task optimization
Ke-Jing Du, Jian-Yu Li, Hua Wang, et al.
Complex & Intelligent Systems (2022) Vol. 9, Iss. 2, pp. 1211-1228
Open Access | Times Cited: 16
Average convergence rate of evolutionary algorithms in continuous optimization
Yu Chen, Jun He
Information Sciences (2021) Vol. 562, pp. 200-219
Open Access | Times Cited: 21
Drift Analysis with Fitness Levels for Elitist Evolutionary Algorithms
Jun He, Yuren Zhou
Evolutionary Computation (2024), pp. 1-25
Open Access | Times Cited: 2
Neural Architecture Search via Multi-Hashing Embedding and Graph Tensor Networks for Multilingual Text Classification
Xueming Yan, Han Huang, Yaochu Jin, et al.
IEEE Transactions on Emerging Topics in Computational Intelligence (2023) Vol. 8, Iss. 1, pp. 350-363
Closed Access | Times Cited: 6
On the robustness of median sampling in noisy evolutionary optimization
Chao Bian, Chao Qian, Yang Yu, et al.
Science China Information Sciences (2021) Vol. 64, Iss. 5
Open Access | Times Cited: 12
Theory of (1 + 1) ES on the RIDGE
Alexandru Agapie, Ovidiu Solomon, Marius Giuclea
IEEE Transactions on Evolutionary Computation (2021) Vol. 26, Iss. 3, pp. 501-511
Open Access | Times Cited: 5
The first hitting time analysis of evolutionary algorithms based on renewal process
Zhensheng Zhou, Lin Wang, Xue Zou, et al.
Electronic Research Archive (2024) Vol. 32, Iss. 5, pp. 2994-3015
Open Access
Theory of (1+1) ES on SPHERE Revisited
Alexandru Agapie, Ovidiu Solomon, Luiza Bădin
IEEE Transactions on Evolutionary Computation (2022) Vol. 27, Iss. 4, pp. 938-948
Open Access | Times Cited: 3
Running-Time Analysis of Brain Storm Optimization Based on Average Gain Model
Guizhen Mai, Fangqing Liu, Yinghan Hong, et al.
Biomimetics (2024) Vol. 9, Iss. 2, pp. 117-117
Open Access
Analyzing the Expected Hitting Time of Evolutionary Computation-Based Neural Architecture Search Algorithms
Zeqiong Lv, Chao Qian, Gary G. Yen, et al.
IEEE Transactions on Emerging Topics in Computational Intelligence (2024), pp. 1-13
Open Access
Genetic algorithm-based selection of optimal Monte Carlo simulations
Francesco Strati, Luca G. Trussoni
Computers & Operations Research (2024), pp. 106958-106958
Closed Access
Error analysis of elitist randomized search heuristics
Cong Wang, Yu Chen, Jun He, et al.
Swarm and Evolutionary Computation (2021) Vol. 63, pp. 100875-100875
Open Access | Times Cited: 4
Spherical Distributions Used in Evolutionary Algorithms
Alexandru Agapie
Mathematics (2021) Vol. 9, Iss. 23, pp. 3098-3098
Open Access | Times Cited: 4
Flamingo Search Algorithm and Its Application to Path Planning Problem
Zhiheng Wang, Jianhua Liu
2021 4th International Conference on Artificial Intelligence and Pattern Recognition (2021), pp. 567-573
Closed Access | Times Cited: 2
Drift Analysis with Fitness Levels for Elitist Evolutionary Algorithms
Jun He, Yuren Zhou
arXiv (Cornell University) (2023)
Open Access
On asymptotic convergence rate of random search
Dawid Tarłowski
Journal of Global Optimization (2023) Vol. 89, Iss. 1, pp. 1-31
Open Access
On Asymptotic Convergence Rate of Evolutionary Algorithms
Dawid Tarłowski
(2023)
Open Access
On Asymptotic Convergence Rate of Evolutionary Algorithms. Discrete and Continuous Optimization
Dawid Tarłowski
(2022)
Open Access
On Asymptotic Convergence Rate of Evolutionary Algorithms
Dawid Tarłowski
(2022)
Open Access
Comparative Analysis of (1 + λ)Evolutionary Algorithms Based on Comparison-in-time Model
Fujian Feng, Zhulian Zhou, Mian Tan, et al.
Research Square (Research Square) (2022)
Open Access
Page 1

Scroll to top