图书馆订阅: Guest
自动化与信息科学期刊

每年出版 12 

ISSN 打印: 1064-2315

ISSN 在线: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

General Approach to Solving Optimization Problems in Distributed Computing Systems and Theory of Intelligence Systems Construction

卷 42, 册 3, 2010, pp. 30-46
DOI: 10.1615/JAutomatInfScien.v42.i3.30
Get accessGet access

摘要

Universal procedures for solving a wide range of discrete optimization problems which can be efficiently parallelized on the basis of cyclic parallel computing structures are proposed. The problem solution is based on the idea of the space of possible solutions of problems of discrete optimization and graph theory in the form of the contracted tree of all paths. Extreme paths formation on the layer of the tree can be carried out simultaneously enabling effective parallelization of computational process to be organized. The analysis of possibilities of using the proposed generalized procedures for constructing intelligent computing systems is performed.

对本文的引用
  1. LISTROVOY S.V., LISTROVAYA E.S., KURTSEV M.S., Rank Approach to the Solution of Problems of Linear and Nonlinear Boolean Programming for Planning and Management in Distributed Computing Systems, Èlektronnoe modelirovanie, 39, 1, 2017. Crossref

  2. LISTROVOY S.V., SIDORENKO A.V., LISTROVAYA E.S., Method of Enumeration of Maximum Independent Sets in Nonoriented Graphs., Èlektronnoe modelirovanie, 39, 4, 2017. Crossref

Begell Digital Portal Begell 数字图书馆 电子图书 期刊 参考文献及会议录 研究收集 订购及政策 Begell House 联系我们 Language English 中文 Русский Português German French Spain