Evolving boolean functions with conjunctions and disjunctions via genetic programming
Author:
Affiliation:
1. École Polytechnique, Palaiseau, France
2. The University of Sheffield, Sheffield, United Kingdom
Funder
Engineering and Physical Sciences Research Council
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/3321707.3321851
Reference21 articles.
1. Compressing Regular Expression Sets for Deep Packet Inspection
2. Benjamin Doerr. 2011. Analyzing Randomized Search Heuristics: Tools from Probability Theory. In Theory of Randomized Search Heuristics Anne Auger and Benjamin Doerr (Eds.). World Scientific 1--20. Benjamin Doerr. 2011. Analyzing Randomized Search Heuristics: Tools from Probability Theory. In Theory of Randomized Search Heuristics Anne Auger and Benjamin Doerr (Eds.). World Scientific 1--20.
3. Adaptive Drift Analysis
4. Multiplicative Drift Analysis
Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error;Artificial Intelligence;2023-06
2. Decision tree and artificial immune systems for stroke prediction in imbalanced data;Expert Systems with Applications;2022-04
3. A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization;ACM Transactions on Evolutionary Learning and Optimization;2021-12-31
4. The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time;Theoretical Computer Science;2020-05
5. On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions;Journal of Artificial Intelligence Research;2019-11-12
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3