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.
Warning: file_get_contents(http://doi.crossref.org/servlet/getForwardLinks?usr=murmansk&pwd=4_mstu&doi=): failed to open stream: HTTP request failed! HTTP/1.1 400 in /var/www/old/sites/vestnik/php/find_ref.php on line 2
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: http://vestnik.mstu.edu.ru/v14_4_n46/articles/789_798_boris.pdf.
