Facilitating evolutionary algorithm analysis with persistent data structures

Research output: Chapter in Book/Report/Conference proceedingsConference contributionpeer-review

1 Citation (Scopus)

Abstract

Evolutionary algorithm analysis is often impeded by the large amounts of intermediate data that is usually discarded and has to be painstakingly reconstructed for real-world large-scale applications. In the recent past persistent data structures have been developed which offer extremely compact storage with acceptable runtime penalties. In this work two promising persistent data structures are explored in the context of evolutionary computation with the hope to open the door to simplified analysis of large-scale evolutionary algorithm runs.

Original languageEnglish
Title of host publicationComputer Aided Systems Theory – EUROCAST 2017 - 16th International Conference, Revised Selected Papers
EditorsRoberto Moreno-Diaz, Alexis Quesada-Arencibia, Franz Pichler
PublisherSpringer Verlag
Pages416-423
Number of pages8
ISBN (Print)9783319747170
DOIs
Publication statusPublished - 2018
Event16th International Conference on Computer Aided Systems Theory, EUROCAST 2017 - Las Palmas de Gran Canaria, Spain
Duration: 19 Feb 201724 Feb 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10671 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference on Computer Aided Systems Theory, EUROCAST 2017
CountrySpain
CityLas Palmas de Gran Canaria
Period19.02.201724.02.2017

Fingerprint Dive into the research topics of 'Facilitating evolutionary algorithm analysis with persistent data structures'. Together they form a unique fingerprint.

Cite this