Analysis of network safety with Markov's chains
Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 48-50
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
The usage of Markov's chains theory allows to describe adequately the process of retrieval optimization with the simplex search algorithms under conditions of uncertainty. The synthesis of algorithms is carried out by optimization of the structure and parametres of multi-connected Markov's chain describing statistical properties of simplex search.
[1] Kuznetsov N. A., Kulba V. V., Mikrin E. A., Informatsionnaya bezopasnost sistem organizatsionnogo upravleniya. Teoreticheskie osnovy, Nauka, M., 2006, 430 pp.