4.7 Article

Fast Immune System-Inspired Hypermutation Operators for Combinatorial Optimization

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Theory & Methods

When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms

Dogan Corus et al.

THEORETICAL COMPUTER SCIENCE (2020)

Article Computer Science, Software Engineering

On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms

Dogan Corus et al.

ALGORITHMICA (2020)

Article Computer Science, Artificial Intelligence

Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem

Dogan Corus et al.

ARTIFICIAL INTELLIGENCE (2019)

Proceedings Paper Computer Science, Artificial Intelligence

On Inversely Proportional Hypermutations with Mutation Potential

Dogan Corus et al.

PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19) (2019)

Article Computer Science, Artificial Intelligence

Standard Steady State Genetic Algorithms Can Hillclimb Faster Than Mutation-Only Evolutionary Algorithms

Dogan Corus et al.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2018)

Article Computer Science, Artificial Intelligence

Level-Based Analysis of Genetic Algorithms and Other Search Processes

Dogan Corus et al.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2018)

Article Computer Science, Artificial Intelligence

Escaping Local Optima Using Crossover With Emergent Diversity

Duc-Cuong Dang et al.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2018)

Article Computer Science, Software Engineering

Optimal Static and Self-Adjusting Parameter Choices for the (1+(λ plus λ)) Genetic Algorithm

Benjamin Doerr et al.

ALGORITHMICA (2018)

Proceedings Paper Computer Science, Artificial Intelligence

Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization

Tobias Friedrich et al.

PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XV, PT I (2018)

Article Computer Science, Software Engineering

On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation

Dogan Corus et al.

ALGORITHMICA (2017)

Article Computer Science, Software Engineering

Towards a Runtime Comparison of Natural and Artificial Evolution

Tiago Paixao et al.

ALGORITHMICA (2017)

Proceedings Paper Computer Science, Artificial Intelligence

Fast Genetic Algorithms

Benjamin Doerr et al.

PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'17) (2017)

Proceedings Paper Computer Science, Artificial Intelligence

On the Runtime Analysis of the Opt-IA Artificial Immune System

Dogan Corus et al.

PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'17) (2017)

Article Computer Science, Information Systems

Efficient Classification for Metric Data

Lee-Ad Gottlieb et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2014)

Article Computer Science, Software Engineering

Black-Box Search by Unbiased Variation

Per Kristian Lehre et al.

ALGORITHMICA (2012)

Article Computer Science, Theory & Methods

Analyzing different variants of immune inspired somatic contiguous hypermutations

Thomas Jansen et al.

THEORETICAL COMPUTER SCIENCE (2011)

Article Computer Science, Artificial Intelligence

Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models

Tobias Friedrich et al.

EVOLUTIONARY COMPUTATION (2010)

Article Computer Science, Artificial Intelligence

Analysis of the (1+1)-EA for Finding Approximate Solutions to Vertex Cover Problems

Pietro S. Oliveto et al.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2009)

Article Computer Science, Artificial Intelligence

An immune algorithm for protein structure prediction on lattice models

Vincenzo Cutello et al.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2007)

Article Computer Science, Artificial Intelligence

Learning and optimization using the clonal selection principle

LN de Castro et al.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2002)

Article Computer Science, Theory & Methods

On the analysis of the (1+1) evolutionary algorithm

S Droste et al.

THEORETICAL COMPUTER SCIENCE (2002)

Article Multidisciplinary Sciences

The easiest hard problem

B Hayes

AMERICAN SCIENTIST (2002)