A memetic algorithm for deinterleaving pulse trains

DOI10.1007/978-3-031-30035-6_5MaRDI QIDQ6149092zbMATH OpenFDO

Authors Jean Pinsolle, Olivier Goudet, Cyrille Enderli, Jin-Kao Hao

Publication date 12 January 2024

Published in Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

Markov processmemetic algorithmpartitioning problemelectronic warfaredeinterleaving pulse trains

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27)

Cites work

• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A memetic algorithm for graph coloring
• Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood
• Hybrid evolutionary algorithms for graph coloring
• Learning Theory
• The consistency of the BIC Markov order estimator.
• Using tabu search techniques for graph coloring

This page was built for publication: A memetic algorithm for deinterleaving pulse trains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149092)