Search for a Moving Element with the Minimum Total Cardinality of Tests
- 作者: Lebedev A.1, Lebedev V.1
-
隶属关系:
- Kharkevich Institute for Information Transmission Problems
- 期: 卷 55, 编号 4 (2019)
- 页面: 396-400
- 栏目: Large Systems
- URL: https://journals.rcsi.science/0032-9460/article/view/166650
- DOI: https://doi.org/10.1134/S0032946019040057
- ID: 166650
如何引用文章
详细
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 \).
作者简介
A. Lebedev
Kharkevich Institute for Information Transmission Problems
编辑信件的主要联系方式.
Email: al_lebed95@mail.ru
俄罗斯联邦, Moscow
V. Lebedev
Kharkevich Institute for Information Transmission Problems
Email: al_lebed95@mail.ru
俄罗斯联邦, Moscow