Размер:
AAA
Цвет: CCC
Изображения: Вкл.Выкл.
Обычная версия сайта
  1. Main
  2. Vestik MGTU

Archive

The editorial board of the "MSTU Vestnik" journal supports the «Open Access» policy which enables users to have free and unlimited access to scientific articles (to read, download, copy, distribute) in case the author is indicated when further quoted.

The academic periodical "Vestnik of MSTU" is available under the license Creative Commons «Attribution» (Attribution) 3.0 Unported (CC BY 3.0).

PDFRead

Abstract. The definition and ways of decision for the problem of modeling of optimum network structures on the basis of code intersections' graphs at joining an arbitrary number of arbitrary networks have been proposed. The given approach allows to reduce essentially algorithmic complexity of the optimizing problem and the requirements to capacity of the calculator in comparison with the traditional approach.

Keywords: code intersections' graph, matrix of intersections of graph tops' numbers, entropy function, regular priority generation, heuristic search, optimization

Printed reference: // Vestnik of MSTU. 2011. V. 14, No 4. P. 789-798.

Electronic reference: // Vestnik of MSTU. 2011. V. 14, No 4. P. 789-798. URL: https://vestnik.mauniver.ru/v14_4_n46/articles/789_798_boris.pdf.

(In Russian, p.10, fig. 2, ref 11, Adobe PDF)