Abstract
In this paper we study the differences in performance among different implementations, in Java, of the data structures used in an evolutionary algorithm (EA). Typical studies on EAs performance deal only with different abstract representations of the data and pay no attention to the fact that each data representation has to be implemented in a concrete programming language which, in general, offers several possibilities, with differences in time consumed, that may be worthy of consideration. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Alba, E., Ferretti, E., & Molina, J. M. (2007). The influence of data implementation in the performance of evolutionary algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4739 LNCS, pp. 764–771). Springer Verlag. https://doi.org/10.1007/978-3-540-75867-9_96
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
