{"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/6","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":6,"pages_in_order":12,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/evolutionary-algorithms/papers/7","papers":[{"url":null,"slug":"is-it-conceivable-that-neurogenesis-neural","title":"Is it conceivable that neurogenesis, neural Darwinism, and species evolution could all serve as inspiration for the creation of evolutionary deep neural networks?","date":"2023-04-06","arxiv_id":"2304.03122","repositories_listed":0,"syntology":null},{"url":null,"slug":"doubly-stochastic-matrix-models-for","title":"Doubly Stochastic Matrix Models for Estimation of Distribution Algorithms","date":"2023-04-05","arxiv_id":"2304.02458","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolving-artificial-neural-networks-to","title":"Evolving Artificial Neural Networks To Imitate Human Behaviour In Shinobi III : Return of the Ninja Master","date":"2023-04-03","arxiv_id":"2304.01096","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-symbolic-regression-for-data","title":"Interpretable Symbolic Regression for Data Science: Analysis of the 2022 Competition","date":"2023-04-03","arxiv_id":"2304.01117","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-impact-of-asynchrony-on-parallel-model","title":"The Impact of Asynchrony on Parallel Model-Based EAs","date":"2023-03-27","arxiv_id":"2303.15543","repositories_listed":0,"syntology":null},{"url":null,"slug":"granular-ball-optimization-algorithm","title":"GBO:AMulti-Granularity Optimization Algorithm via Granular-ball for Continuous Problems","date":"2023-03-18","arxiv_id":"2303.12807","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-performance-indicators-to-use-for-self","title":"Towards Self-adaptive Mutation in Evolutionary Multi-Objective Algorithms","date":"2023-03-08","arxiv_id":"2303.04611","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-design-of-the-memory-subsystem","title":"Evolutionary Design of the Memory Subsystem","date":"2023-03-07","arxiv_id":"2303.16074","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-multi-objective-algorithms-for","title":"Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits","date":"2023-03-03","arxiv_id":"2303.01695","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-computation-in-action","title":"Evolutionary Computation in Action: Feature Selection for Deep Embedding Spaces of Gigapixel Pathology Images","date":"2023-03-02","arxiv_id":"2303.00943","repositories_listed":0,"syntology":null},{"url":null,"slug":"lasting-diversity-and-superior-runtime","title":"Lasting Diversity and Superior Runtime Guarantees for the $(μ+1)$ Genetic Algorithm","date":"2023-02-24","arxiv_id":"2302.12570","repositories_listed":0,"syntology":null},{"url":null,"slug":"tight-runtime-bounds-for-static-unary","title":"Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions","date":"2023-02-23","arxiv_id":"2302.12338","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-objective-optimization-of-energy","title":"Multi-objective optimization of energy consumption and execution time in a single level cache memory for embedded systems","date":"2023-02-22","arxiv_id":"2302.11236","repositories_listed":0,"syntology":null},{"url":null,"slug":"forecasting-and-stabilizing-chaotic-regimes","title":"Forecasting and stabilizing chaotic regimes in two macroeconomic models via artificial intelligence technologies and control methods","date":"2023-02-20","arxiv_id":"2302.12019","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-three-phase-artificial-orcas-algorithm-for","title":"A Three-Phase Artificial Orcas Algorithm for Continuous and Discrete Problems","date":"2023-02-17","arxiv_id":"2302.08855","repositories_listed":0,"syntology":null},{"url":null,"slug":"fourier-analysis-meets-runtime-analysis","title":"Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus","date":"2023-02-16","arxiv_id":"2302.08021","repositories_listed":0,"syntology":null},{"url":null,"slug":"tools-for-landscape-analysis-of-optimisation","title":"Tools for Landscape Analysis of Optimisation Problems in Procedural Content Generation for Games","date":"2023-02-16","arxiv_id":"2302.08479","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-mutation-decompositions-fine-tuning","title":"Sparse Mutation Decompositions: Fine Tuning Deep Neural Networks with Subspace Evolution","date":"2023-02-12","arxiv_id":"2302.05832","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-proof-that-using-crossover-can-guarantee","title":"Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation","date":"2023-01-31","arxiv_id":"2301.13687","repositories_listed":0,"syntology":null},{"url":null,"slug":"enabling-surrogate-assisted-evolutionary","title":"Enabling surrogate-assisted evolutionary reinforcement learning via policy embedding","date":"2023-01-31","arxiv_id":"2301.13374","repositories_listed":0,"syntology":null},{"url":null,"slug":"atm-r-an-adaptive-tradeoff-model-with","title":"ATM-R: An Adaptive Tradeoff Model with Reference Points for Constrained Multiobjective Evolutionary Optimization","date":"2023-01-09","arxiv_id":"2301.03317","repositories_listed":0,"syntology":null},{"url":null,"slug":"runtime-performance-of-evolutionary","title":"Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem","date":"2022-12-22","arxiv_id":"2212.11478","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-the-score-of-atomic-candidate-owl","title":"Predicting the Score of Atomic Candidate OWL Class Axioms","date":"2022-12-21","arxiv_id":"2212.10841","repositories_listed":0,"syntology":null},{"url":null,"slug":"jax-accelerated-neuroevolution-of-physics","title":"Neuroevolution of Physics-Informed Neural Nets: Benchmark Problems and Comparative Results","date":"2022-12-15","arxiv_id":"2212.07624","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-hybridization-of-branch-and-bound-with","title":"The Hybridization of Branch and Bound with Metaheuristics for Nonconvex Multiobjective Optimization","date":"2022-12-09","arxiv_id":"2212.04624","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-evolutionary-clustering-have-theoretical","title":"Can Evolutionary Clustering Have Theoretical Guarantees?","date":"2022-12-04","arxiv_id":"2212.01771","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-effect-of-epigenetic-blocking-on-dynamic","title":"The Effect of Epigenetic Blocking on Dynamic Multi-Objective Optimisation Problems","date":"2022-11-25","arxiv_id":"2211.14222","repositories_listed":0,"syntology":null},{"url":null,"slug":"assessing-quality-diversity-neuro-evolution","title":"Assessing Quality-Diversity Neuro-Evolution Algorithms Performance in Hard Exploration Problems","date":"2022-11-24","arxiv_id":"2211.13742","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-strategies-for-the-design-of","title":"Evolutionary Strategies for the Design of Binary Linear Codes","date":"2022-11-21","arxiv_id":"2211.11551","repositories_listed":0,"syntology":null},{"url":null,"slug":"re-visiting-reservoir-computing-architectures","title":"Re-visiting Reservoir Computing architectures optimized by Evolutionary Algorithms","date":"2022-11-11","arxiv_id":"2211.06254","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-multiobjective-evolutionary","title":"Collaborative Multiobjective Evolutionary Algorithms in search of better Pareto Fronts. An application to trading systems","date":"2022-11-04","arxiv_id":"2211.02451","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-adaptive-evolutionary-computation","title":"Learning Adaptive Evolutionary Computation for Solving Multi-Objective Optimization Problems","date":"2022-11-01","arxiv_id":"2211.09719","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-the-effectiveness-of-surrogate","title":"Exploring the effectiveness of surrogate-assisted evolutionary algorithms on the batch processing problem","date":"2022-10-31","arxiv_id":"2210.17149","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-retrieval-system-using","title":"Information retrieval system using evolutionary algorithms","date":"2022-10-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sub-network-multi-objective-evolutionary","title":"Sub-network Multi-objective Evolutionary Algorithm for Filter Pruning","date":"2022-10-22","arxiv_id":"2211.01957","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-secure-federated-data-driven-evolutionary","title":"A Secure Federated Data-Driven Evolutionary Multi-objective Optimization Algorithm","date":"2022-10-15","arxiv_id":"2210.08295","repositories_listed":0,"syntology":null},{"url":null,"slug":"e2r-a-hierarchical-learning-inspired-novelty","title":"E2R: a Hierarchical-Learning inspired Novelty-Search method to generate diverse repertoires of grasping trajectories","date":"2022-10-14","arxiv_id":"2210.07887","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-the-evolutionary-algorithms-by","title":"Accelerating the Evolutionary Algorithms by Gaussian Process Regression with $ε$-greedy acquisition function","date":"2022-10-13","arxiv_id":"2210.06814","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolution-is-still-good-theoretical-analysis","title":"Evolution is Still Good: Theoretical Analysis of Evolutionary Algorithms on General Cover Problems","date":"2022-10-03","arxiv_id":"2210.00672","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuroevo-a-cloud-based-platform-for-automated","title":"NeuroEvo: A Cloud-based Platform for Automated Design and Training of Neural Networks using Evolutionary and Particle Swarm Algorithms","date":"2022-10-01","arxiv_id":"2210.00286","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-study-of-q-learning-and","title":"Comparative Study of Q-Learning and NeuroEvolution of Augmenting Topologies for Self Driving Agents","date":"2022-09-19","arxiv_id":"2209.09007","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-deep-reinforcement-learning","title":"Evolutionary Deep Reinforcement Learning Using Elite Buffer: A Novel Approach Towards DRL Combined with EA in Continuous Control Tasks","date":"2022-09-18","arxiv_id":"2209.08480","repositories_listed":0,"syntology":null},{"url":null,"slug":"diversity-and-novelty-masterprints-generating","title":"Diversity and Novelty MasterPrints: Generating Multiple DeepMasterPrints for Increased User Coverage","date":"2022-09-11","arxiv_id":"2209.04909","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-to-prune-and-what-not-to-prune-at-1","title":"What to Prune and What Not to Prune at Initialization","date":"2022-09-06","arxiv_id":"2209.02201","repositories_listed":0,"syntology":null},{"url":null,"slug":"understandable-controller-extraction-from","title":"Understandable Controller Extraction from Video Observations of Swarms","date":"2022-09-02","arxiv_id":"2209.01118","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-differential-evolution-algorithm","title":"Accelerating differential evolution algorithm with Gaussian sampling based on estimating the convergence points","date":"2022-08-31","arxiv_id":"2208.14619","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolving-the-mcts-upper-confidence-bounds-for","title":"Evolving the MCTS Upper Confidence Bounds for Trees Using a Semantic-inspired Evolutionary Algorithm in the Game of Carcassonne","date":"2022-08-29","arxiv_id":"2208.13589","repositories_listed":0,"syntology":null},{"url":null,"slug":"differential-evolution-variants-for-searching","title":"Differential evolution variants for Searching D- and A-optimal designs","date":"2022-08-24","arxiv_id":"2208.11262","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-multiplicity-preserving-crossover-operator","title":"A multiplicity-preserving crossover operator on graphs. Extended version","date":"2022-08-23","arxiv_id":"2208.10881","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhanced-opposition-differential-evolution","title":"Enhanced Opposition Differential Evolution Algorithm for Multimodal Optimization","date":"2022-08-23","arxiv_id":"2208.11066","repositories_listed":0,"syntology":null},{"url":null,"slug":"runtime-analysis-of-the-1-1-ea-on-weighted","title":"Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions","date":"2022-08-11","arxiv_id":"2208.05670","repositories_listed":0,"syntology":null},{"url":"/paper/designing-deep-convolutional-neural-networks-1","slug":"designing-deep-convolutional-neural-networks-1","title":"Designing Deep Convolutional Neural Networks using a Genetic Algorithm for Image-based Malware Classification","date":"2022-07-18","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-compression-with-classically","title":"Quantum compression with classically simulatable circuits","date":"2022-07-06","arxiv_id":"2207.02961","repositories_listed":0,"syntology":null},{"url":null,"slug":"runtime-analysis-for-permutation-based","title":"Runtime Analysis for Permutation-based Evolutionary Algorithms","date":"2022-07-05","arxiv_id":"2207.04045","repositories_listed":0,"syntology":null},{"url":null,"slug":"runtime-analysis-of-competitive-co","title":"Runtime Analysis of Competitive co-Evolutionary Algorithms for Maximin Optimisation of a Bilinear Function","date":"2022-06-30","arxiv_id":"2206.15238","repositories_listed":0,"syntology":null},{"url":null,"slug":"emergence-of-novelty-in-evolutionary","title":"Emergence of Novelty in Evolutionary Algorithms","date":"2022-06-27","arxiv_id":"2207.04857","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-learnable-evolutionary-algorithms","title":"A Survey on Learnable Evolutionary Algorithms for Scalable Multiobjective Optimization","date":"2022-06-23","arxiv_id":"2206.11526","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-time-use-optimization-for","title":"Evolutionary Time-Use Optimization for Improving Children's Health Outcomes","date":"2022-06-23","arxiv_id":"2206.11505","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-enhanced-selection-operators-for","title":"Quantum-Enhanced Selection Operators for Evolutionary Algorithms","date":"2022-06-21","arxiv_id":"2206.10743","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-objective-hyperparameter-optimization","title":"Multi-Objective Hyperparameter Optimization in Machine Learning -- An Overview","date":"2022-06-15","arxiv_id":"2206.07438","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-circuit-sizing-with-multi-objective","title":"Automated Circuit Sizing with Multi-objective Optimization based on Differential Evolution and Bayesian Inference","date":"2022-06-06","arxiv_id":"2206.02391","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandit-theory-and-thompson-sampling-guided","title":"Bandit Theory and Thompson Sampling-Guided Directed Evolution for Sequence Optimization","date":"2022-06-05","arxiv_id":"2206.02092","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-effective-and-efficient-evolutionary","title":"An Effective and Efficient Evolutionary Algorithm for Many-Objective Optimization","date":"2022-05-31","arxiv_id":"2205.15884","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolution-as-a-service-a-privacy-preserving","title":"Evolution as a Service: A Privacy-Preserving Genetic Algorithm for Combinatorial Optimization","date":"2022-05-27","arxiv_id":"2205.13948","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparing-the-digital-annealer-with-classical","title":"Comparing the Digital Annealer with Classical Evolutionary Algorithm","date":"2022-05-26","arxiv_id":"2205.13586","repositories_listed":0,"syntology":null},{"url":null,"slug":"balancing-exploration-and-exploitation-for","title":"Balancing Exploration and Exploitation for Solving Large-scale Multiobjective Optimization via Attention Mechanism","date":"2022-05-20","arxiv_id":"2205.10052","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hardware-aware-framework-for-accelerating","title":"A Hardware-Aware Framework for Accelerating Neural Architecture Search Across Modalities","date":"2022-05-19","arxiv_id":"2205.10358","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-optimization-of-the-verlet","title":"Evolutionary optimization of the Verlet closure relation for the hard-sphere and square-well fluids","date":"2022-05-14","arxiv_id":"2205.07104","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuroevolutionary-multi-objective-approaches","title":"Neuroevolutionary Multi-objective approaches to Trajectory Prediction in Autonomous Vehicles","date":"2022-05-04","arxiv_id":"2205.02105","repositories_listed":0,"syntology":null},{"url":null,"slug":"seeding-diversity-into-ai-art","title":"Seeding Diversity into AI Art","date":"2022-05-02","arxiv_id":"2205.00804","repositories_listed":0,"syntology":null},{"url":null,"slug":"lipschitz-based-surrogate-model-for-high","title":"Combining Lipschitz and RBF Surrogate Models for High-dimensional Computationally Expensive Problems","date":"2022-04-29","arxiv_id":"2204.14236","repositories_listed":0,"syntology":null},{"url":null,"slug":"run-time-analysis-for-random-local-search-on","title":"Run Time Analysis for Random Local Search on Generalized Majority Functions","date":"2022-04-27","arxiv_id":"2204.12770","repositories_listed":0,"syntology":null},{"url":null,"slug":"reference-vector-adaptation-and-mating","title":"Reference Vector Adaptation and Mating Selection Strategy via Adaptive Resonance Theory-based Clustering for Many-objective Optimization","date":"2022-04-22","arxiv_id":"2204.10756","repositories_listed":0,"syntology":null},{"url":null,"slug":"analyzing-the-impact-of-undersampling-on-the","title":"Analyzing the Impact of Undersampling on the Benchmarking and Configuration of Evolutionary Algorithms","date":"2022-04-20","arxiv_id":"2204.09353","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-stronger-theory-for-permutation","title":"Towards a Stronger Theory for Permutation-based Evolutionary Algorithms","date":"2022-04-15","arxiv_id":"2204.07637","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-collaborative-decomposition-based","title":"A collaborative decomposition-based evolutionary algorithm integrating normal and penalty-based boundary intersection for many-objective optimization","date":"2022-04-14","arxiv_id":"2204.07176","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-algorithms-for-limiting-the","title":"Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits","date":"2022-04-12","arxiv_id":"2204.05597","repositories_listed":0,"syntology":null},{"url":null,"slug":"hard-problems-are-easier-for-success-based","title":"Hard Problems are Easier for Success-based Parameter Control","date":"2022-04-12","arxiv_id":"2204.05817","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-network-pruning-by-cooperative","title":"Neural Network Pruning by Cooperative Coevolution","date":"2022-04-12","arxiv_id":"2204.05639","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-mutation-rate-adaptation-through","title":"Effective Mutation Rate Adaptation through Group Elite Selection","date":"2022-04-11","arxiv_id":"2204.04817","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-compact-genetic-algorithm-struggles-on","title":"The Compact Genetic Algorithm Struggles on Cliff Functions","date":"2022-04-11","arxiv_id":"2204.04904","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-evolution-strategies-for-black","title":"Distributed Evolution Strategies for Black-box Stochastic Optimization","date":"2022-04-09","arxiv_id":"2204.04450","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-inference-of-fault-tree-models-via","title":"Automatic inference of fault tree models via multi-objective evolutionary algorithms","date":"2022-04-06","arxiv_id":"2204.03743","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficiently-evolving-swarm-behaviors-using","title":"Efficiently Evolving Swarm Behaviors Using Grammatical Evolution With PPA-style Behavior Trees","date":"2022-03-29","arxiv_id":"2203.15776","repositories_listed":0,"syntology":null},{"url":null,"slug":"surrogate-assisted-evolutionary-multi","title":"Surrogate Assisted Evolutionary Multi-objective Optimisation applied to a Pressure Swing Adsorption system","date":"2022-03-28","arxiv_id":"2204.12585","repositories_listed":0,"syntology":null},{"url":null,"slug":"focused-jump-and-repair-constraint-handling","title":"Focused Jump-and-Repair Constraint Handling for Fixed-Parameter Tractable Graph Problems Closed Under Induced Subgraphs","date":"2022-03-25","arxiv_id":"2203.13877","repositories_listed":0,"syntology":null},{"url":null,"slug":"are-evolutionary-algorithms-safe-optimizers","title":"Are Evolutionary Algorithms Safe Optimizers?","date":"2022-03-24","arxiv_id":"2203.12622","repositories_listed":0,"syntology":null},{"url":null,"slug":"intelligent-systematic-investment-agent-an","title":"Intelligent Systematic Investment Agent: an ensemble of deep learning and evolutionary strategies","date":"2022-03-24","arxiv_id":"2203.13125","repositories_listed":0,"syntology":null},{"url":null,"slug":"running-time-analysis-of-the-non-dominated","title":"Running Time Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) using Binary or Stochastic Tournament Selection","date":"2022-03-22","arxiv_id":"2203.11550","repositories_listed":0,"syntology":null},{"url":null,"slug":"pareto-optimization-or-cascaded-weighted-sum","title":"Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts","date":"2022-03-05","arxiv_id":"2203.02697","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-instance-space-analysis-of-constrained","title":"An Instance Space Analysis of Constrained Multi-Objective Optimization Problems","date":"2022-03-02","arxiv_id":"2203.00868","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hardware-aware-system-for-accelerating-deep","title":"A Hardware-Aware System for Accelerating Deep Neural Network Optimization","date":"2022-02-25","arxiv_id":"2202.12954","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-neural-architecture-exploration","title":"Accelerating Neural Architecture Exploration Across Modalities Using Genetic Algorithms","date":"2022-02-25","arxiv_id":"2202.12934","repositories_listed":0,"syntology":null},{"url":null,"slug":"novel-metric-based-on-walsh-coefficients-for","title":"Novel Metric based on Walsh Coefficients for measuring problem difficulty in Estimation of Distribution Algorithms","date":"2022-02-24","arxiv_id":"2203.13195","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-genetic-operators-are-universal","title":"Simple Genetic Operators are Universal Approximators of Probability Distributions (and other Advantages of Expressive Encodings)","date":"2022-02-19","arxiv_id":"2202.09679","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolving-constructions-for-balanced-highly","title":"Evolving Constructions for Balanced, Highly Nonlinear Boolean Functions","date":"2022-02-17","arxiv_id":"2202.08743","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-strong-physically-unclonable","title":"Modeling Strong Physically Unclonable Functions with Metaheuristics","date":"2022-02-16","arxiv_id":"2202.08079","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-pipelines-with-evolutionarily","title":"Interpretable pipelines with evolutionarily optimized modules for RL tasks with visual inputs","date":"2022-02-10","arxiv_id":"2202.04943","repositories_listed":0,"syntology":null},{"url":null,"slug":"heed-the-noise-in-performance-evaluations-in","title":"Heed the Noise in Performance Evaluations in Neural Architecture Search","date":"2022-02-04","arxiv_id":"2202.02078","repositories_listed":0,"syntology":null},{"url":null,"slug":"diversity-enhancement-via-magnitude","title":"Diversity Enhancement via Magnitude","date":"2022-01-25","arxiv_id":"2201.10037","repositories_listed":0,"syntology":null}],"record_sha256":"2e35d4410e713aad3b0c0b73616894442e25590b41df6412fa20d6f8fa92ed1c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}