Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




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

Avtomatika i Telemekhanika, 1983, Issue 2, Pages 171–174 (Mi at5074)  
This article is cited in 1 scientific paper (total in 1 paper)

Notes

On convergence of the Narendra-Shapiro automaton algorithm

A. V. Nazin, A. S. Poznyak

Moscow
Full-text PDF (536 kB) Citations (1)
Abstract: The convergence and rate of convergence of the Narendra-Shapiro automaton algorithm which rearranges the probabilities of choice of options for minimizing mean losses are investigated. The optimal parameters of the algorithm are determined.

Received: 11.06.1981
Bibliographic databases:
Document Type: Article
UDC: 65.01
Language: Russian
Citation: A. V. Nazin, A. S. Poznyak, “On convergence of the Narendra-Shapiro automaton algorithm”, Avtomat. i Telemekh., 1983, no. 2, 171–174
Citation in format AMSBIB
\Bibitem{NazPoz83}
\by A.~V.~Nazin, A.~S.~Poznyak
\paper On convergence of the Narendra-Shapiro automaton algorithm
\jour Avtomat. i Telemekh.
\yr 1983
\issue 2
\pages 171--174
\mathnet{http://mi.mathnet.ru/at5074}
\zmath{https://zbmath.org/?q=an:0526.68048}
Linking options:
  • https://www.mathnet.ru/eng/at5074
  • https://www.mathnet.ru/eng/at/y1983/i2/p171
    • 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
    		Avtomatika i Telemekhanika
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024