Реферат: The problem under consideration is an unstudied optimization problem induced by the segregation-based noise-proof recognition of a sequence being the sum of two quasiperiodic sequences. The goal is to prove that this problem is solvable in polynomial time and to construct an algorithm that guaranties the solution optimality. The research is motivated by the lack of efficient (polynomial-time) algorithms with a priori guaranteed bounds for the solution accuracy. The studied problem is relevant to noise-proof monitoring of natural objects whose typical behaviour can be described as quasiperiodic alternation of active and passive states in the case when it is impossible to isolate a signal by a single object and we have to process a mixed sygnal from a pair of such objects. The polynomial-time solvability of the problem has been constructively proven, the numerical simulation results are presented

Библиографическая ссылка: Mikhailova L.
Segregation-Based Quasiperiodic Sequenses Recognition
XXIV International conference “Mathematical Optimization Theory and Operations Research” 07-11 Jul 2025