Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2021
Paradiseo: from a modular framework for evolutionary computation to the automated design of metaheuristics: 22 years of Paradiseo
- Johann Dreo,
- Arnaud Liefooghe,
- Sébastien Verel,
- Marc Schoenauer,
- Juan J. Merelo,
- Alexandre Quemy,
- Benjamin Bouvier,
- Jan Gmys
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1522–1530https://doi.org/10.1145/3449726.3463276The success of metaheuristic optimization methods has led to the development of a large variety of algorithm paradigms. However, no algorithm clearly dominates all its competitors on all problems. Instead, the underlying variety of landscapes of ...
- research-articleJuly 2021
Component-based design of multi-objective evolutionary algorithms using the Tigon optimization library
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1531–1539https://doi.org/10.1145/3449726.3463194Multi-objective optimization problems involve several conflicting objectives that have to be optimized simultaneously. Generating a complete Pareto-optimal front (POF) can be computationally expensive or even infeasible, and for that reason there has ...
- research-articleJuly 2021
Determining a consistent experimental setup for benchmarking and optimizing databases
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1614–1621https://doi.org/10.1145/3449726.3463180The evaluation of the performance of an IT system is a fundamental operation in its benchmarking and optimization. However, despite the general consensus on the importance of this task, little guidance is usually provided to practitioners who need to ...
- research-articleJuly 2021
Dissipative polynomials
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1683–1691https://doi.org/10.1145/3449726.3463147Limited precision floating point computer implementations of large polynomial arithmetic expressions are nonlinear and dissipative. They are not reversible (irreversible, lack conservation), lose information, and so are robust to perturbations (anti-...
- research-articleJuly 2021
AI programmer: autonomously creating software programs using genetic algorithms
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 1513–1521https://doi.org/10.1145/3449726.3463125In this paper, we present AI Programmer, a machine learning (ML) system that can automatically generate full software programs, while requiring only minimal human guidance. At its core, AI Programmer uses a genetic algorithm (GA), coupled with a tightly ...
- abstractJuly 2021
Genetic improvement of data for maths functions
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 31–32https://doi.org/10.1145/3449726.3462730Genetic Improvement (GI) can be used to give better quality software and to create new functionality.
We show that GI can evolve the PowerPC open source GNU C runtime library square root function into cube root, binary logarithm log2 and reciprocal ...
- abstractJuly 2021
Achieving weight coverage for an autonomous driving system with search-based test generation (HOP track at GECCO 2021)
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 33–34https://doi.org/10.1145/3449726.3462723Autonomous Driving Systems (ADSs) are complex critical systems that must be thoroughly tested. Still, assessing the strength of tests for ADSs is an open and complex problem. Weight Coverage is a test criterion targeting ADSs which are based on a ...
- abstractJuly 2021
Improving assertion oracles with evolutionary computation
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 45–46https://doi.org/10.1145/3449726.3462722Assertion oracles are executable boolean expressions placed inside a software program that verify the correctness of test executions. A perfect assertion oracle passes (returns true) for all correct executions and fails (returns false) for all incorrect ...
- abstractJuly 2021
Do quality indicators prefer particular multi-objective search algorithms in search-based software engineering?: (hot off the press track at GECCO 2021)
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 21–22https://doi.org/10.1145/3449726.3462721In Search-based Software Engineering (SBSE), researchers and practitioners (SBSE users) using multi-objective search algorithms (MOSAs) often select commonly used MOSAs to solve their search problems. Such a selection is usually not justified, and the ...
- abstractJuly 2021
Genetic improvement of routing in delay tolerant networks
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 35–36https://doi.org/10.1145/3449726.3462716Routing plays a fundamental role in network applications, but it is especially challenging in Delay Tolerant Networks (DTNs). These are a kind of mobile ad hoc networks made of e.g. (possibly, unmanned) vehicles and humans where, despite a lack of ...
- posterJuly 2021
Using knowledge of human-generated code to bias the search in program synthesis with grammatical evolution
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 331–332https://doi.org/10.1145/3449726.3459548Recent studies show that program synthesis with GE produces code that has different structure compared to human-generated code, e.g., loops and conditions are hardly used. In this article, we extract knowledge from human-generated code to guide ...
- posterJuly 2021
Neurogenetic programming framework for explainable reinforcement learning
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 329–330https://doi.org/10.1145/3449726.3459537Automatic programming, the task of generating computer programs compliant with a specification without a human developer, is usually tackled either via genetic programming methods based on mutation and recombination of programs, or via neural language ...
- posterJuly 2021
Empirical analysis of variance for genetic programming based symbolic regression
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 251–252https://doi.org/10.1145/3449726.3459486Genetic programming (GP) based symbolic regression is a stochastic, high-variance algorithm. Its sensitivity to changes in training data is a drawback for practical applications.
In this work, we analyze empirically the variance of GP models on the ...
- posterJuly 2021
It's the journey not the destination: building genetic algorithms practitioners can trust
GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPages 231–232https://doi.org/10.1145/3449726.3459483This poster paper presents 2 recommendations for algorithm developers as best practices in the context of engineering design. Genetic algorithms are well suited for multi-objective optimisation problems which are common in engineering. However, the use ...