Maximal time of pursuit for the strategy of parallel approach
Prombles in programming 2014; 4: 78-93
Saved in:
Date: | 2019 |
---|---|
Main Authors: | Pashko, S.V., Yalovets, A.L. |
Format: | Article |
Language: | rus |
Published: |
Інститут програмних систем НАН України
2019
|
Subjects: | |
Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/686 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Journal Title: | Problems in programming |
Institution
Problems in programmingSimilar Items
-
NP-hardness of collective pursuiting optimization problems
by: Pashko, S.V.
Published: (2025) -
Numerical Methods for Solving the Pursuit Optimization Problems
by: Pashko, C.V., et al.
Published: (2025) -
Construction of pursuit strategies with using Lyapunov functions
by: Pashko, S.V.
Published: (2018) -
Guaranteed time of pursuit for the strategy of parallel approach
by: S. V. Pashko
Published: (2014) -
Modification of the family three-point iterative method for refinement of simple roots of monotonic nonsmooth function
by: Шелудько, Г. А., et al.
Published: (2015)