A memetic algorithm for deinterleaving pulse trains
From MaRDI portal
Publication:6149092
DOI10.1007/978-3-031-30035-6_5MaRDI QIDQ6149092FDOQ6149092
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)
Approximation methods and heuristics in mathematical programming (90C59) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- The consistency of the BIC Markov order estimator.
- Hybrid evolutionary algorithms for graph coloring
- A memetic algorithm for graph coloring
- Using tabu search techniques for graph coloring
- Learning Theory
- Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood
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)