Zapiski Nauchnykh Seminarov LOMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find






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


Zapiski Nauchnykh Seminarov LOMI, 1988, Volume 166, Pages 72–90 (Mi znsl5549)  

Statistical problems of choice and synthesis of optimal algorithms

N. N. Ljashenko, E. L. Evnevich
Abstract: Statistical approach to a construction of the optimal compound algorithm under condition of bounded complexity is described. It is shown that different variants of the problem are reducible to the linear programming problem.
Bibliographic databases:
Document Type: Article
UDC: 519.281
Language: Russian
Citation: N. N. Ljashenko, E. L. Evnevich, “Statistical problems of choice and synthesis of optimal algorithms”, Studies in mathematical statistics. Part 8, Zap. Nauchn. Sem. LOMI, 166, "Nauka", Leningrad. Otdel., Leningrad, 1988, 72–90
Citation in format AMSBIB
\Bibitem{LjaEvn88}
\by N.~N.~Ljashenko, E.~L.~Evnevich
\paper Statistical problems of choice and synthesis of optimal algorithms
\inbook Studies in mathematical statistics. Part~8
\serial Zap. Nauchn. Sem. LOMI
\yr 1988
\vol 166
\pages 72--90
\publ "Nauka", Leningrad. Otdel.
\publaddr Leningrad
\mathnet{http://mi.mathnet.ru/znsl5549}
\zmath{https://zbmath.org/?q=an:0900.68236|0688.68025}
Linking options:
  • https://www.mathnet.ru/eng/znsl5549
  • https://www.mathnet.ru/eng/znsl/v166/p72
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:105
    Full-text PDF :45
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024