Runtime analysis of the (1 + ( λ, λ )) genetic algorithm on random satisfiable 3-CNF formulas
Author:
Affiliation:
1. ITMO University, Saint-Petersburg, Russia
2. École Polytechnique, Palaiseau, France
Funder
Ministry of Education and Science of the Russian Federation
Électricité de France
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/3071178.3071297
Reference12 articles.
1. Black-box Complexity of Parallel Search with Distributed Populations
2. Optimal Parameter Settings for the (1 + λ, λ) Genetic Algorithm
3. Optimal Parameter Choices Through Self-Adjustment
4. A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax
5. From black-box complexity to designing new genetic algorithms
Cited by 46 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improving arabic signature authentication with quantum inspired evolutionary feature selection;Multimedia Tools and Applications;2024-02-08
2. Choosing the right algorithm with hints from complexity theory;Information and Computation;2024-01
3. Empirical Evaluation of Evolutionary Algorithms with Power-Law Ranking Selection;IFIP Advances in Information and Communication Technology;2024
4. Using Automated Algorithm Configuration for Parameter Control;Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms;2023-08-30
5. Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches;Proceedings of the Companion Conference on Genetic and Evolutionary Computation;2023-07-15
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3