Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 2019, Volume 55, Issue 4, Pages 107–111
DOI: https://doi.org/10.1134/S0555292319040053 (Mi ppi2306) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Large Systems

Search for a moving element with the minimum total cardinality of tests

A. V. Lebedev, V. S. Lebedev

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Full-text PDF (145 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.1134/S0555292319040053
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: combinatorial search, test, adaptive strategy, optimal algorithm.
Funding agency Grant number
Russian Foundation for Basic Research 19-01-00364
The research was supported in part by the Russian Foundation for Basic Research, project no. 19-01-00364.
Received: 07.03.2019
Revised: 15.10.2019
Accepted: 12.11.2019
English version:
Problems of Information Transmission, 2019, Volume 55, Issue 4, Pages 396–400
DOI: https://doi.org/10.1134/S0032946019040057
Bibliographic databases:
Document Type: Article
UDC: 621.391.1 : 519.1
Language: Russian
Citation: A. V. Lebedev, V. S. Lebedev, “Search for a moving element with the minimum total cardinality of tests”, Probl. Peredachi Inf., 55:4 (2019), 107–111; Problems Inform. Transmission, 55:4 (2019), 396–400
Citation in format AMSBIB
\Bibitem{LebLeb19}
\by A.~V.~Lebedev, V.~S.~Lebedev
\paper Search for a moving element with the minimum total cardinality of tests
\jour Probl. Peredachi Inf.
\yr 2019
\vol 55
\issue 4
\pages 107--111
\mathnet{http://mi.mathnet.ru/ppi2306}
\crossref{https://doi.org/10.1134/S0555292319040053}
\elib{https://elibrary.ru/item.asp?id=43246470}
\transl
\jour Problems Inform. Transmission
\yr 2019
\vol 55
\issue 4
\pages 396--400
\crossref{https://doi.org/10.1134/S0032946019040057}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000520150600005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85078345344}
Linking options:
  • https://www.mathnet.ru/eng/ppi2306
  • https://www.mathnet.ru/eng/ppi/v55/i4/p107
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:159
    Full-text PDF :22
    References:20
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024