|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
1. |
M. G. Konovalov, R. V. Razumchik, “Algorithm for global optimization of time-related stationary characteristics of jobs in nonobservable parallel queues”, Sistemy i Sredstva Inform., 33:4 (2023), 50–59 |
2. |
M. G. Konovalov, R. V. Razumchik, “Dispatching in nonobservable parallel queues with finite capacities”, Sistemy i Sredstva Inform., 33:3 (2023), 29–47 |
1
|
|
2022 |
3. |
M. G. Konovalov, R. V. Razumchik, “Controlling a bounded two-dimensional Markov chain with a given invariant measure”, Inform. Primen., 16:2 (2022), 109–117 |
|
2021 |
4. |
M. G. Konovalov, R. V. Razumchik, “Routing jobs to heterogeneous parallel queues using distributed policy gradient algorithm”, Inform. Primen., 15:3 (2021), 41–50 |
2
|
|
2019 |
5. |
M. G. Konovalov, R. V. Razumchik, “Mixed policies for online job allocation in one class of systems with parallel service”, Inform. Primen., 13:4 (2019), 54–59 |
2
|
6. |
Ya. M. Agalarov, M. G. Konovalov, “Proof of the unimodality of the objective function in $M/M/N$ queue with threshold-based congestion control”, Inform. Primen., 13:2 (2019), 2–6 |
4
|
|
2018 |
7. |
M. G. Konovalov, R. V. Razumchik, “Comparison of two active queue management schemes through the $M/D/1/N$ queue”, Inform. Primen., 12:4 (2018), 9–15 |
7
|
8. |
M. G. Konovalov, R. V. Razumchik, “Finding control policy for one discrete-time Markov chain on $[0, 1]$ with a given invariant measure”, Inform. Primen., 12:3 (2018), 2–13 |
1
|
|
2017 |
9. |
M. G. Konovalov, R. V. Razumchik, “Controlling queue size in a single server system”, Sistemy i Sredstva Inform., 27:4 (2017), 4–15 |
|
2016 |
10. |
M. G. Konovalov, R. V. Razumchik, “Dispatching to two parallel nonobservable queues using only static information”, Inform. Primen., 10:4 (2016), 57–67 |
3
|
|
2015 |
11. |
M. G. Konovalov, R. V. Razumchik, “Methods and algorithms for job scheduling in systems with parallel service: a survey”, Inform. Primen., 9:4 (2015), 56–67 |
5
|
12. |
M. G. Konovalov, R. V. Razumchik, “Approximate optimization of resource allocation strategy: the case of bank underwriting system”, Sistemy i Sredstva Inform., 25:4 (2015), 31–51 |
|
2014 |
13. |
M. G. Konovalov, “Building a simulation model for solving scheduling problems of computing resources”, Sistemy i Sredstva Inform., 24:4 (2014), 45–62 |
4
|
|
2013 |
14. |
M. G. Konovalov, “About one task of overload control”, Inform. Primen., 7:4 (2013), 34–43 |
7
|
|
2012 |
15. |
M. G. Konovalov, “About adaptive strategies and their existence conditions”, Inform. Primen., 6:4 (2012), 18–26 |
16. |
M. G. Konovalov, “Computer system optimization using simulation model and adaptive algorithms”, Inform. Primen., 6:1 (2012), 37–48 |
5
|
|
2010 |
17. |
M. G. Konovalov, “On task flow planning in computational resource systems”, Inform. Primen., 4:2 (2010), 3–12 |
1
|
|
2009 |
18. |
M. G. Konovalov, Yu. Dushin, Yu. E. Malashenko, S. Ya. Shorgin, “The model of interaction among consumers and remote computational resources by means of brokers”, Sistemy i Sredstva Inform., 2009, no. 19, 5–33 |
2
|
|
2006 |
19. |
S. V. Antonov, Yu. A. Dushin, M. G. Konovalov, S. Ya. Shorgin, “Development of mathematical models and methods of task distribution in distributed computational system”, Sistemy i Sredstva Inform., 2006, no. 16, 32–45 |
1
|
|
1993 |
20. |
M. G. Konovalov, “Experience in data network modelling with help of parallel processes language”, Matem. Mod., 5:2 (1993), 82–93 |
|
1986 |
21. |
M. G. Konovalov, “Adaptive control of finite automata with nonobservable states”, Dokl. Akad. Nauk SSSR, 291:1 (1986), 59–62 |
|
1977 |
22. |
M. G. Konovalov, “On adaptive control of some classes of Markov chains”, Dokl. Akad. Nauk SSSR, 233:5 (1977), 780–783 |
|
Organisations |
|
|
|
|