|
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.
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
Linking options:
https://www.mathnet.ru/eng/znsl5549 https://www.mathnet.ru/eng/znsl/v166/p72
|
Statistics & downloads: |
Abstract page: | 105 | Full-text PDF : | 45 |
|