The completeness of the algorithm algebra with data
The completeness of the algorithm algebra with data is shown which is intended for coordinated design of control flow and processed data is shown. The feasibility of an implementation of a control-driven and a data-driven algorithm development using both ascending and descending design strategies is...
Saved in:
Date: | 2018 |
---|---|
Main Authors: | Akulovskiy, V.G., Doroshenko, А.Yu., Yatsenko, O.A. |
Format: | Article |
Language: | rus |
Published: |
Інститут програмних систем НАН України
2018
|
Subjects: | |
Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/207 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Journal Title: | Problems in programming |
Institution
Problems in programmingSimilar Items
-
Description of parallelism in algorithms of information management systems using algebraic apparatus
by: Akulovsky, V.G., et al.
Published: (2025) -
About the method of projecting abstract data type at the algebra of algorithmic
by: Doroshenko, A.Yu., et al.
Published: (2018) -
Means of parametrically controlled generation of algorithms on the basis of algebra of hyperscales
by: Yatsenko, O.A.
Published: (2015) -
Design of a terrain surface visualization program using algebra-algorithmic tools
by: Doroshenko, А.Yu., et al.
Published: (2019) -
Information technologies for decision support systems in regional development management
by: Prosyankina-Zharova, Tetyana
Published: (2025)