Email this article Search for a Moving Element with the Minimum Total Cardinality of Tests
- Authors: Lebedev A.V.1, Lebedev V.S.1
-
Affiliations:
- Kharkevich Institute for Information Transmission Problems
- Issue: Vol 55, No 4 (2019)
- Pages: 396-400
- Section: Large Systems
- URL: https://journal-vniispk.ru/0032-9460/article/view/166650
- DOI: https://doi.org/10.1134/S0032946019040057
- ID: 166650
Cite item
Open Access
Access granted
Subscription Access
Abstract
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 \).
Keywords
About the authors
A. V. Lebedev
Kharkevich Institute for Information Transmission Problems
Author for correspondence.
Email: al_lebed95@mail.ru
Russian Federation, Moscow
V. S. Lebedev
Kharkevich Institute for Information Transmission Problems
Email: al_lebed95@mail.ru
Russian Federation, Moscow
Supplementary files
