{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/evolutionary-algorithms/papers/3","list_of":"/task/evolutionary-algorithms","task":"Evolutionary Algorithms","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":12,"rows_per_page":100,"rows":[201,300],"of":1107,"counts":{"archive_papers_tagged":1107,"with_a_code_link":241,"where_syntology_ran_a_sample":36,"not_listed_spam_title":0,"listed":1107,"listed_where_code_ran":36,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":32,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":32,"listed_every_run_a_failure_of_syntologys_instrument":4,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/evolutionary-algorithms","prev":"/task/evolutionary-algorithms/papers/2","next":"/task/evolutionary-algorithms/papers/4","papers":[{"url":"/paper/rolling-horizon-evolutionary-algorithms-for","slug":"rolling-horizon-evolutionary-algorithms-for","title":"Rolling Horizon Evolutionary Algorithms for General Video Game Playing","date":"2020-03-27","arxiv_id":"2003.12331","repositories_listed":1,"syntology":null},{"url":"/paper/solving-portfolio-optimization-problems-using","slug":"solving-portfolio-optimization-problems-using","title":"Solving Portfolio Optimization Problems Using MOEA/D and Levy Flight","date":"2020-03-15","arxiv_id":"2003.06737","repositories_listed":1,"syntology":null},{"url":"/paper/simulation-visualization-and-analysis-tools","slug":"simulation-visualization-and-analysis-tools","title":"Simulation, visualization and analysis tools for pattern recognition assessment with spiking neuronal networks","date":"2020-03-13","arxiv_id":"2003.06343","repositories_listed":1,"syntology":null},{"url":"/paper/uncovering-coresets-for-classification-with","slug":"uncovering-coresets-for-classification-with","title":"Uncovering Coresets for Classification With Multi-Objective Evolutionary Algorithms","date":"2020-02-20","arxiv_id":"2002.08645","repositories_listed":1,"syntology":null},{"url":"/paper/differential-evolution-with-reversible-linear","slug":"differential-evolution-with-reversible-linear","title":"Differential Evolution with Reversible Linear Transformations","date":"2020-02-07","arxiv_id":"2002.02869","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differential-evolution-with-reversible-linear#ran","syntology_url":"https://syntology.ai/paper/2002.02869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02869"}},"official":{"repos":["jmtomczak/reversible-de"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-networks-in-evolutionary-dynamic","slug":"neural-networks-in-evolutionary-dynamic","title":"Neural Networks in Evolutionary Dynamic Constrained Optimization: Computational Cost and Benefits","date":"2020-01-22","arxiv_id":"2001.11588","repositories_listed":1,"syntology":null},{"url":"/paper/quantitative-genetic-algorithms","slug":"quantitative-genetic-algorithms","title":"Information-geometric optimization with natural selection","date":"2019-12-06","arxiv_id":"1912.03395","repositories_listed":1,"syntology":null},{"url":"/paper/covariance-matrix-adaptation-greedy-search","slug":"covariance-matrix-adaptation-greedy-search","title":"Covariance Matrix Adaptation Greedy Search Applied to Water Distribution System Optimization","date":"2019-09-11","arxiv_id":"1909.04846","repositories_listed":1,"syntology":null},{"url":"/paper/evolvability-es-scalable-and-direct","slug":"evolvability-es-scalable-and-direct","title":"Evolvability ES: Scalable and Direct Optimization of Evolvability","date":"2019-07-13","arxiv_id":"1907.06077","repositories_listed":1,"syntology":null},{"url":"/paper/procedural-content-generation-through-quality","slug":"procedural-content-generation-through-quality","title":"Procedural Content Generation through Quality Diversity","date":"2019-07-09","arxiv_id":"1907.04053","repositories_listed":1,"syntology":null},{"url":"/paper/sample-efficient-neural-architecture-search","slug":"sample-efficient-neural-architecture-search","title":"Sample-Efficient Neural Architecture Search by Learning Action Space","date":"2019-06-17","arxiv_id":"1906.06832","repositories_listed":1,"syntology":null},{"url":"/paper/190503389","slug":"190503389","title":"Learning to Evolve","date":"2019-05-08","arxiv_id":"1905.03389","repositories_listed":1,"syntology":null},{"url":"/paper/intentional-computational-level-design","slug":"intentional-computational-level-design","title":"Intentional Computational Level Design","date":"2019-04-18","arxiv_id":"1904.08972","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-find-hard-instances-of-graph","slug":"learning-to-find-hard-instances-of-graph","title":"Learning to Sample Hard Instances for Graph Algorithms","date":"2019-02-26","arxiv_id":"1902.09700","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-neural-automl-for-deep-learning","slug":"evolutionary-neural-automl-for-deep-learning","title":"Evolutionary Neural AutoML for Deep Learning","date":"2019-02-18","arxiv_id":"1902.06827","repositories_listed":1,"syntology":null},{"url":"/paper/novelty-search-for-deep-reinforcement","slug":"novelty-search-for-deep-reinforcement","title":"Novelty Search for Deep Reinforcement Learning Policy Network Weights by Action Sequence Edit Metric Distance","date":"2019-02-08","arxiv_id":"1902.03142","repositories_listed":1,"syntology":null},{"url":"/paper/self-adjusting-mutation-rates-with-provably","slug":"self-adjusting-mutation-rates-with-provably","title":"Self-Adjusting Mutation Rates with Provably Optimal Success Rules","date":"2019-02-07","arxiv_id":"1902.02588","repositories_listed":1,"syntology":null},{"url":"/paper/voronoi-based-efficient-surrogate-assisted","slug":"voronoi-based-efficient-surrogate-assisted","title":"Voronoi-based Efficient Surrogate-assisted Evolutionary Algorithm for Very Expensive Problems","date":"2019-01-17","arxiv_id":"1901.05755","repositories_listed":1,"syntology":null},{"url":"/paper/general-subpopulation-framework-and-taming","slug":"general-subpopulation-framework-and-taming","title":"General Subpopulation Framework and Taming the Conflict Inside Populations","date":"2019-01-02","arxiv_id":"1901.00266","repositories_listed":1,"syntology":null},{"url":"/paper/sample-efficient-neural-architecture-search-1","slug":"sample-efficient-neural-architecture-search-1","title":"Sample-Efficient Neural Architecture Search by Learning Action Space for Monte Carlo Tree Search","date":"2019-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-stochastic-gradient-descent-for","slug":"evolutionary-stochastic-gradient-descent-for","title":"Evolutionary Stochastic Gradient Descent for Optimization of Deep Neural Networks","date":"2018-10-16","arxiv_id":"1810.06773","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-groups-of-colluding-strong","slug":"optimizing-groups-of-colluding-strong","title":"Optimizing groups of colluding strong attackers in mobile urban communication networks with evolutionary algorithms","date":"2018-10-05","arxiv_id":"1810.02713","repositories_listed":1,"syntology":null},{"url":"/paper/merge-non-dominated-sorting-algorithm-for","slug":"merge-non-dominated-sorting-algorithm-for","title":"Merge Non-Dominated Sorting Algorithm for Many-Objective Optimization","date":"2018-09-17","arxiv_id":"1809.06106","repositories_listed":1,"syntology":null},{"url":"/paper/a-linear-constrained-optimization-benchmark","slug":"a-linear-constrained-optimization-benchmark","title":"A Linear Constrained Optimization Benchmark For Probabilistic Search Algorithms: The Rotated Klee-Minty Problem","date":"2018-07-26","arxiv_id":"1807.10068","repositories_listed":1,"syntology":null},{"url":"/paper/neuzz-efficient-fuzzing-with-neural-program","slug":"neuzz-efficient-fuzzing-with-neural-program","title":"NEUZZ: Efficient Fuzzing with Neural Program Smoothing","date":"2018-07-15","arxiv_id":"1807.05620","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neuzz-efficient-fuzzing-with-neural-program#ran","syntology_url":"https://syntology.ai/paper/1807.05620","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.05620"}},"official":{"repos":["dongdongshe/neuzz"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/limited-evaluation-evolutionary-optimization","slug":"limited-evaluation-evolutionary-optimization","title":"Limited Evaluation Evolutionary Optimization of Large Neural Networks","date":"2018-06-26","arxiv_id":"1806.09819","repositories_listed":1,"syntology":null},{"url":"/paper/vine-an-open-source-interactive-data","slug":"vine-an-open-source-interactive-data","title":"VINE: An Open Source Interactive Data Visualization Tool for Neuroevolution","date":"2018-05-03","arxiv_id":"1805.01141","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-margin-evolutionary-classifier","slug":"optimal-margin-evolutionary-classifier","title":"Optimal-margin evolutionary classifier","date":"2018-04-26","arxiv_id":"1804.09891","repositories_listed":1,"syntology":null},{"url":"/paper/gray-box-optimization-and-factorized","slug":"gray-box-optimization-and-factorized","title":"Gray-box optimization and factorized distribution algorithms: where two worlds collide","date":"2017-07-11","arxiv_id":"1707.03093","repositories_listed":1,"syntology":null},{"url":"/paper/pasmoqap-a-parallel-asynchronous-memetic","slug":"pasmoqap-a-parallel-asynchronous-memetic","title":"PasMoQAP: A Parallel Asynchronous Memetic Algorithm for solving the Multi-Objective Quadratic Assignment Problem","date":"2017-06-27","arxiv_id":"1706.08700","repositories_listed":1,"syntology":null},{"url":"/paper/co-evolutionary-multi-task-learning-for","slug":"co-evolutionary-multi-task-learning-for","title":"Co-evolutionary multi-task learning for dynamic time series prediction","date":"2017-02-27","arxiv_id":"1703.01887","repositories_listed":1,"syntology":null},{"url":"/paper/can-evolutionary-sampling-improve-bagged","slug":"can-evolutionary-sampling-improve-bagged","title":"Can Evolutionary Sampling Improve Bagged Ensembles?","date":"2016-10-03","arxiv_id":"1610.00465","repositories_listed":1,"syntology":null},{"url":"/paper/automatically-proving-mathematical-theorems","slug":"automatically-proving-mathematical-theorems","title":"Automatically Proving Mathematical Theorems with Evolutionary Algorithms and Proof Assistants","date":"2016-02-24","arxiv_id":"1602.07455","repositories_listed":1,"syntology":null},{"url":"/paper/there-is-no-fast-lunch-an-examination-of-the","slug":"there-is-no-fast-lunch-an-examination-of-the","title":"There is no fast lunch: an examination of the running speed of evolutionary algorithms in several languages","date":"2015-11-03","arxiv_id":"1511.01088","repositories_listed":1,"syntology":null},{"url":"/paper/a-java-implementation-of-parameter-less","slug":"a-java-implementation-of-parameter-less","title":"A Java Implementation of Parameter-less Evolutionary Algorithms","date":"2015-06-26","arxiv_id":"1506.08694","repositories_listed":1,"syntology":null},{"url":"/paper/a-java-implementation-of-the-sga-umda-ecga","slug":"a-java-implementation-of-the-sga-umda-ecga","title":"A Java Implementation of the SGA, UMDA, ECGA, and HBOA","date":"2015-06-26","arxiv_id":"1506.07980","repositories_listed":1,"syntology":null},{"url":"/paper/java-implementation-of-a-parameter-less","slug":"java-implementation-of-a-parameter-less","title":"Java Implementation of a Parameter-less Evolutionary Portfolio","date":"2015-06-26","arxiv_id":"1506.08867","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-energy-aware-node-clustering","slug":"a-novel-energy-aware-node-clustering","title":"A Novel Energy Aware Node Clustering Algorithm for Wireless Sensor Networks Using a Modified Artificial Fish Swarm Algorithm","date":"2015-05-30","arxiv_id":"1506.00099","repositories_listed":1,"syntology":null},{"url":"/paper/a-swarm-optimization-algorithm-inspired-in","slug":"a-swarm-optimization-algorithm-inspired-in","title":"A swarm optimization algorithm inspired in the behavior of the social-spider","date":"2014-06-12","arxiv_id":"1406.3282","repositories_listed":1,"syntology":null},{"url":"/paper/towards-the-evolution-of-vertical-axis-wind","slug":"towards-the-evolution-of-vertical-axis-wind","title":"Towards the Evolution of Vertical-Axis Wind Turbines using Supershapes","date":"2012-04-18","arxiv_id":"1204.4107","repositories_listed":1,"syntology":null},{"url":"/paper/natural-evolution-strategies","slug":"natural-evolution-strategies","title":"Natural Evolution Strategies","date":"2011-06-22","arxiv_id":"1106.4487","repositories_listed":1,"syntology":null},{"url":null,"slug":"adversarial-attacks-to-image-classification","title":"Adversarial attacks to image classification systems using evolutionary algorithms","date":"2025-07-17","arxiv_id":"2507.13136","repositories_listed":0,"syntology":null},{"url":null,"slug":"dasvit-differentiable-architecture-search-for","title":"DASViT: Differentiable Architecture Search for Vision Transformer","date":"2025-07-17","arxiv_id":"2507.13079","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-population-gan-training-analyzing-co","title":"Multi-population GAN Training: Analyzing Co-Evolutionary Algorithms","date":"2025-07-17","arxiv_id":"2507.13157","repositories_listed":0,"syntology":null},{"url":null,"slug":"sensing-accuracy-optimization-for-multi-uav","title":"Sensing Accuracy Optimization for Multi-UAV SAR Interferometry with Data Offloading","date":"2025-07-15","arxiv_id":"2507.11284","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-and-coevolutionary-multi-agent","title":"Evolutionary and Coevolutionary Multi-Agent Design Choices and Dynamics","date":"2025-07-07","arxiv_id":"2507.05534","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm-guided-chemical-process-optimization-with","title":"LLM-guided Chemical Process Optimization with a Multi-Agent Approach","date":"2025-06-26","arxiv_id":"2506.20921","repositories_listed":0,"syntology":null},{"url":null,"slug":"surrogate-assisted-evolution-for-efficient","title":"Surrogate-Assisted Evolution for Efficient Multi-branch Connection Design in Deep Neural Networks","date":"2025-06-25","arxiv_id":"2506.20469","repositories_listed":0,"syntology":null},{"url":null,"slug":"synergizing-reinforcement-learning-and","title":"Synergizing Reinforcement Learning and Genetic Algorithms for Neural Combinatorial Optimization","date":"2025-06-11","arxiv_id":"2506.09404","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-task-oriented-dialogue-policy","title":"An Efficient Task-Oriented Dialogue Policy: Evolutionary Reinforcement Learning Injected by Elite Individuals","date":"2025-06-04","arxiv_id":"2506.03519","repositories_listed":0,"syntology":null},{"url":null,"slug":"surrogate-assisted-evolutionary-reinforcement","title":"Surrogate-Assisted Evolutionary Reinforcement Learning Based on Autoencoder and Hyperbolic Neural Network","date":"2025-05-26","arxiv_id":"2505.19423","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-dynamical-systems-learning-with","title":"Integrating Dynamical Systems Learning with Foundational Models: A Meta-Evolutionary AI Framework for Clinical Trials","date":"2025-05-25","arxiv_id":"2506.14782","repositories_listed":0,"syntology":null},{"url":null,"slug":"adapting-novelty-towards-generating-antigens","title":"Adapting Novelty towards Generating Antigens for Antivirus systems","date":"2025-05-24","arxiv_id":"2505.18520","repositories_listed":0,"syntology":null},{"url":null,"slug":"cma-es-with-radial-basis-function-surrogate","title":"CMA-ES with Radial Basis Function Surrogate for Black-Box Optimization","date":"2025-05-22","arxiv_id":"2505.16127","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-computation-and-large-language","title":"Evolutionary Computation and Large Language Models: A Survey of Methods, Synergies, and Applications","date":"2025-05-21","arxiv_id":"2505.15741","repositories_listed":0,"syntology":null},{"url":null,"slug":"mmd-newton-method-for-multi-objective","title":"MMD-Newton Method for Multi-objective Optimization","date":"2025-05-20","arxiv_id":"2505.14610","repositories_listed":0,"syntology":null},{"url":null,"slug":"weak-pareto-boundary-the-achilles-heel-of","title":"Weak Pareto Boundary: The Achilles' Heel of Evolutionary Multi-Objective Optimization","date":"2025-05-20","arxiv_id":"2505.13854","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-parameter-control-for-the-1-l-l-ga-on","title":"Multi-parameter Control for the (1+($λ$,$λ$))-GA on OneMax via Deep Reinforcement Learning","date":"2025-05-19","arxiv_id":"2505.12982","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-evolutionary-neural-networks-for","title":"Quantum-Evolutionary Neural Networks for Multi-Agent Federated Learning","date":"2025-05-16","arxiv_id":"2505.15836","repositories_listed":0,"syntology":null},{"url":null,"slug":"visual-evolutionary-optimization-on","title":"Visual Evolutionary Optimization on Combinatorial Problems with Multimodal Large Language Models: A Case Study of Influence Maximization","date":"2025-05-11","arxiv_id":"2505.06850","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-speed-ups-for-the-sms-emoa-from-a","title":"Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy","date":"2025-05-03","arxiv_id":"2505.01647","repositories_listed":0,"syntology":null},{"url":null,"slug":"proven-approximation-guarantees-in-multi","title":"Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II","date":"2025-05-02","arxiv_id":"2505.01323","repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-scenario-optimisation-for-the-chance","title":"Weighted-Scenario Optimisation for the Chance Constrained Travelling Thief Problem","date":"2025-05-01","arxiv_id":"2505.00269","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-memetic-algorithm-based-on-variational","title":"A Memetic Algorithm based on Variational Autoencoder for Black-Box Discrete Optimization with Epistasis among Parameters","date":"2025-04-30","arxiv_id":"2504.21338","repositories_listed":0,"syntology":null},{"url":null,"slug":"generate-more-than-one-child-in-your-co","title":"Generate more than one child in your co-evolutionary semi-supervised learning GAN","date":"2025-04-29","arxiv_id":"2504.20560","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comparison-relationship-surrogate","title":"A Comparison-Relationship-Surrogate Evolutionary Algorithm for Multi-Objective Optimization","date":"2025-04-28","arxiv_id":"2504.19411","repositories_listed":0,"syntology":null},{"url":null,"slug":"intelligent4dse-optimizing-high-level","title":"Intelligent4DSE: Optimizing High-Level Synthesis Design Space Exploration with Graph Neural Networks and Large Language Models","date":"2025-04-28","arxiv_id":"2504.19649","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-systematic-study-on-the-design-of-odd-sized","title":"A Systematic Study on the Design of Odd-Sized Highly Nonlinear Boolean Functions via Evolutionary Algorithms","date":"2025-04-24","arxiv_id":"2504.17666","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolution-meets-diffusion-efficient-neural","title":"Evolution Meets Diffusion: Efficient Neural Architecture Generation","date":"2025-04-24","arxiv_id":"2504.17827","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-design-of-compliant-mechanisms","title":"Efficient Design of Compliant Mechanisms Using Multi-Objective Optimization","date":"2025-04-23","arxiv_id":"2504.16451","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuro-evolutionary-approach-to-physics-aware","title":"Neuro-Evolutionary Approach to Physics-Aware Symbolic Regression","date":"2025-04-23","arxiv_id":"2504.16503","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-analysis-of-evolutionary-1","title":"Comparative Analysis of Evolutionary Algorithms for Energy-Aware Production Scheduling","date":"2025-04-22","arxiv_id":"2504.15672","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-balanced-approach-of-rapid-genetic","title":"A Balanced Approach of Rapid Genetic Exploration and Surrogate Exploitation for Hyperparameter Optimization","date":"2025-04-10","arxiv_id":"2504.07359","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-algorithms-meet-self-supervised","title":"Evolutionary algorithms meet self-supervised learning: a comprehensive survey","date":"2025-04-09","arxiv_id":"2504.07213","repositories_listed":0,"syntology":null},{"url":null,"slug":"defending-deep-neural-networks-against","title":"Defending Deep Neural Networks against Backdoor Attacks via Module Switching","date":"2025-04-08","arxiv_id":"2504.05902","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-dynamics-of-mating-preferences-in","title":"On the Dynamics of Mating Preferences in Genetic Programming","date":"2025-04-08","arxiv_id":"2504.06110","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm-guided-evolution-an-autonomous-model","title":"LLM-Guided Evolution: An Autonomous Model Optimization for Object Detection","date":"2025-04-03","arxiv_id":"2504.02280","repositories_listed":0,"syntology":null},{"url":null,"slug":"advancements-in-multimodal-differential","title":"Advancements in Multimodal Differential Evolution: A Comprehensive Review and Future Perspectives","date":"2025-04-01","arxiv_id":"2504.00717","repositories_listed":0,"syntology":null},{"url":null,"slug":"mono2rest-identifying-and-exposing","title":"MONO2REST: Identifying and Exposing Microservices: a Reusable RESTification Approach","date":"2025-03-27","arxiv_id":"2503.21522","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-adaptive-expert-for-multimodal","title":"Hierarchical Adaptive Expert for Multimodal Sentiment Analysis","date":"2025-03-25","arxiv_id":"2503.22715","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-policy-optimization","title":"Evolutionary Policy Optimization","date":"2025-03-24","arxiv_id":"2503.19037","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-objective-pseudo-boolean-functions-in","title":"Multi-objective Pseudo Boolean Functions in Runtime Analysis: A Review","date":"2025-03-24","arxiv_id":"2503.19166","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-language-models-via-privacy","title":"Personalized Language Models via Privacy-Preserving Evolutionary Model Merging","date":"2025-03-23","arxiv_id":"2503.18008","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comprehensive-survey-on-multi-agent","title":"A Comprehensive Survey on Multi-Agent Cooperative Decision-Making: Scenarios, Approaches, Challenges and Perspectives","date":"2025-03-17","arxiv_id":"2503.13415","repositories_listed":0,"syntology":null},{"url":null,"slug":"impact-of-surrogate-model-accuracy-on","title":"Impact of Surrogate Model Accuracy on Performance and Model Management Strategy in Surrogate-Assisted Evolutionary Algorithms","date":"2025-03-02","arxiv_id":"2503.00844","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimation-of-total-body-fat-using-symbolic","title":"Estimation of total body fat using symbolic regression and evolutionary algorithms","date":"2025-03-01","arxiv_id":"2503.00594","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-weight-adaptation-trigger-mechanism-in","title":"A Weight Adaptation Trigger Mechanism in Decomposition-based Evolutionary Multi-Objective Optimisation","date":"2025-02-23","arxiv_id":"2502.16481","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-algorithms-approach-for-search","title":"Evolutionary Algorithms Approach For Search Based On Semantic Document Similarity","date":"2025-02-20","arxiv_id":"2502.19437","repositories_listed":0,"syntology":null},{"url":null,"slug":"warm-starting-of-cma-es-for-contextual","title":"Warm Starting of CMA-ES for Contextual Optimization Problems","date":"2025-02-18","arxiv_id":"2502.12555","repositories_listed":0,"syntology":null},{"url":null,"slug":"ai-driven-materials-design-a-mini-review","title":"AI-driven materials design: a mini-review","date":"2025-02-05","arxiv_id":"2502.02905","repositories_listed":0,"syntology":null},{"url":null,"slug":"discovering-quality-diversity-algorithms-via","title":"Discovering Quality-Diversity Algorithms via Meta-Black-Box Optimization","date":"2025-02-04","arxiv_id":"2502.02190","repositories_listed":0,"syntology":null},{"url":null,"slug":"degree-is-important-on-evolving-homogeneous","title":"Degree is Important: On Evolving Homogeneous Boolean Functions","date":"2025-01-30","arxiv_id":"2501.18407","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-policy-gradient-quality-diversity","title":"Scaling Policy Gradient Quality-Diversity with Massive Parallelization via Behavioral Variations","date":"2025-01-30","arxiv_id":"2501.18723","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-population-update-provably-needs","title":"Stochastic Population Update Provably Needs An Archive in Evolutionary Multi-objective Optimization","date":"2025-01-28","arxiv_id":"2501.16735","repositories_listed":0,"syntology":null},{"url":null,"slug":"comprehensive-benchmarking-environment-for","title":"A Benchmarking Environment for Worker Flexibility in Flexible Job Shop Scheduling Problems","date":"2025-01-27","arxiv_id":"2501.16159","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-based-automated-design","title":"Reinforcement learning Based Automated Design of Differential Evolution Algorithm for Black-box Optimization","date":"2025-01-22","arxiv_id":"2501.12881","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-the-hype-benchmarking-llm-evolved","title":"Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing","date":"2025-01-20","arxiv_id":"2501.11411","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-ranknet-inspired-surrogate-assisted-hybrid","title":"A RankNet-Inspired Surrogate-Assisted Hybrid Metaheuristic for Expensive Coverage Optimization","date":"2025-01-13","arxiv_id":"2501.07375","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiple-gain-estimation-for-running-time-of","title":"Multiple-gain Estimation for Running Time of Evolutionary Combinatorial Optimization","date":"2025-01-13","arxiv_id":"2501.07000","repositories_listed":0,"syntology":null},{"url":null,"slug":"pareto-optimization-with-robust-evaluation","title":"Pareto Optimization with Robust Evaluation for Noisy Subset Selection","date":"2025-01-12","arxiv_id":"2501.06813","repositories_listed":0,"syntology":null}],"record_sha256":"0e5b50efae0ee75f01b6ca8a58387dc021255b465da9a821f8a279b07a41b3ae","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}