RO EN
Algorithm and program for finding the optimal paths in dynamic networks
Authors: A. Leconiuc
– 0.12 Mb
Abstract
The program of finding the optimal paths in dynamic networks is studied. Some aspects concerning the implementation of an earlier proposed algorithm, as well as the description of the program that actualy reprezents the algorithm implementation are prezented.A.Leconiuc,
Institute of Mathematics
and Computer Science,
Academy of Sciences of Moldova
5, Academiei str., Kishinev,
MD2028, Moldova
phone: 73-83-35
e-mail:
Institute of Mathematics
and Computer Science,
Academy of Sciences of Moldova
5, Academiei str., Kishinev,
MD2028, Moldova
phone: 73-83-35
e-mail:
Fulltext
– 0.12 Mb
Contents
- To the 35th anniversary of the Institute of Mathematics and Computer Science of the Academy of Sciences of the Republic of Moldova
- Complex Membership Grades with an Application to the Design of Adaptive Filters
- PRONET: Basic concepts of a system of Artificial Intelligence
- Stability of a majority efficient solution of a vector linear trajectorial problem
- Algorithm and program for finding the optimal paths in dynamic networks
- Methods of solving of the optimal stabilization problem for stationary smooth control systems. Part II Ending
- Definition of necessary length of random sequences at execution of the empirical tests (criterion x2)
- Abstracts of PH. D. Theses
