Enviar artigo por via de e-mail Search for a Moving Element with the Minimum Total Cardinality of Tests
- Autores: Lebedev A.V.1, Lebedev V.S.1
-
Afiliações:
- Kharkevich Institute for Information Transmission Problems
- Edição: Volume 55, Nº 4 (2019)
- Páginas: 396-400
- Seção: Large Systems
- URL: https://journal-vniispk.ru/0032-9460/article/view/166650
- DOI: https://doi.org/10.1134/S0032946019040057
- ID: 166650
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
We consider the moving element search problem with the minimum total cardinality of tests. As a search space, we consider the set of integer points of a segment of length n. We prove that the total test cardinality of an asymptotically optimal adaptive strategy is \(n + 2\sqrt n \).
Palavras-chave
Sobre autores
A. Lebedev
Kharkevich Institute for Information Transmission Problems
Autor responsável pela correspondência
Email: al_lebed95@mail.ru
Rússia, Moscow
V. Lebedev
Kharkevich Institute for Information Transmission Problems
Email: al_lebed95@mail.ru
Rússia, Moscow
Arquivos suplementares
