2015
DOI: 10.1134/s1064562415030357
|View full text |Cite
|
Sign up to set email alerts
|

Aggregation correct operations on algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…As a result, each disjunct receives a minimized knowledge base corresponding to the set of rules described by this disjunct. Such disjuncts have a number of properties (Shibzukhov, 2014). They break down the information about the solution domain into all possible IT classes.…”
Section: A Logical Approach To Designing An Algorithm Based On the Ru...mentioning
confidence: 99%
“…As a result, each disjunct receives a minimized knowledge base corresponding to the set of rules described by this disjunct. Such disjuncts have a number of properties (Shibzukhov, 2014). They break down the information about the solution domain into all possible IT classes.…”
Section: A Logical Approach To Designing An Algorithm Based On the Ru...mentioning
confidence: 99%
“…Of great interest are direct sums that allow you to simultaneously form the architecture of a computer network and configure its parameters, without resorting to solving complex optimization problems to achieve the correctness of its functioning [5].…”
Section: Formulation Of the Problemmentioning
confidence: 99%