The design of (almost) disjunct matrices by evolutionary algorithms

DOI10.1007/978-3-030-04070-3_12zbMath1522.68774OpenAlexW2901901812MaRDI QIDQ6073026

Domagoj Jakobovic, Luca Mariot, Alberto Leporati, Karlo Knezevic, Stjepan Picek

Publication date: 16 October 2023

Published in: Theory and Practice of Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-04070-3_12

zbMATH Keywords

genetic algorithmsgenetic programminggroup testingestimation of distribution algorithmsevolutionary computingdisjunct matricesalmost disjunct matricesresolvable matrices

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorics in computer science (68R05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A survey of metaheuristic algorithms for the design of cryptographic Boolean functions ⋮ Evolutionary strategies for the design of binary linear codes

Cites Work

• Unnamed Item
• Unnamed Item
• Generalized cover-free families.
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Fully dynamic de Bruijn graphs
• Cover-free families and topology-transparent scheduling for MANETs
• Group Testing Schemes From Codes and Designs
• On Almost Disjunct Matrices for Group Testing
• An Optimization Problem Related to Bloom Filters with Bit Patterns
• Explicit Nonadaptive Combinatorial Group Testing Schemes
• Nonrandom binary superimposed codes
• Introduction to evolutionary computing

This page was built for publication: The design of (almost) disjunct matrices by evolutionary algorithms