Analysis of network safety with Markov's chains
Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 48-50
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.
@article{PDM_2009_10_a23,
author = {I. N. Kirko and V. P. Kushnir},
title = {Analysis of network safety with {Markov's} chains},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {48--50},
year = {2009},
number = {10},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2009_10_a23/}
}
I. N. Kirko; V. P. Kushnir. Analysis of network safety with Markov's chains. Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 48-50. http://geodesic.mathdoc.fr/item/PDM_2009_10_a23/
[1] Kuznetsov N. A., Kulba V. V., Mikrin E. A., Informatsionnaya bezopasnost sistem organizatsionnogo upravleniya. Teoreticheskie osnovy, Nauka, M., 2006, 430 pp.