activity
20162026
most citedMutually Orthogonal Latin Squares based on Cellular Automata

24 citations · 41 across the 45 of their papers we have counts for

collaborators
Showing 2021 · cs.NEShow all

5 papers · 2 filters

cs.NE2021

On the Difficulty of Evolving Permutation Codes

Luca Mariot, Stjepan Picek, Domagoj Jakobovic +2

Combinatorial designs provide an interesting source of optimization problems. Among them, permutation codes are particularly interesting given their applications in powerline commu…

cs.NE2021

Deriving Smaller Orthogonal Arrays from Bigger Ones with Genetic Algorithm

Luca Mariot

We consider the optimization problem of constructing a binary orthogonal array (OA) starting from a bigger one, by removing a specified amount of lines. In particular, we develop a…

cs.NE2021★ 2 cited

Salp Swarm Optimization: a Critical Review

Mauro Castelli, Luca Manzoni, Luca Mariot +2

In the crowded environment of bio-inspired population-based metaheuristics, the Salp Swarm Optimization (SSO) algorithm recently appeared and immediately gained a lot of momentum.…

cs.NE2021

Evolutionary Algorithms for Designing Reversible Cellular Automata

Luca Mariot, Stjepan Picek, Domagoj Jakobovic +1

Reversible Cellular Automata (RCA) are a particular kind of shift-invariant transformations characterized by a dynamics composed only of disjoint cycles. They have many application…

cs.NE2021

On the Genotype Compression and Expansion for Evolutionary Algorithms in the Continuous Domain

Lucija Planinic, Marko Djurasevic, Luca Mariot +3

This paper investigates the influence of genotype size on evolutionary algorithms' performance. We consider genotype compression (where genotype is smaller than phenotype) and expa…