Поиск по всему репозиторию:
The Approach of the Shortest Path Planning Problem Solution on the Basis of a Neural Network
| dc.contributor.author | Dimakov, V. | ru |
| dc.coverage.spatial | Brest | ru |
| dc.date.accessioned | 2021-07-27T08:09:24Z | |
| dc.date.available | 2021-07-27T08:09:24Z | |
| dc.date.issued | 1999 | |
| dc.identifier.citation | Dimakov, V. The Approach of the Shortest Path Planning Problem Solution on the Basis of a Neural Network / V. Dimakov // International Conference on Neural Networks and Artificial Intelligence ICNNAI'99 = Международная конференция по нейронным сетям и искусственному интеллекту ICNNAI'99 : Proceedings, Brest, Belarus, 12–15 October 1999 / Brest Polytechnic Institute, Department of Computers and Laboratory of Artificial Neural Networks, Belarus Special Interest Group of International Neural NetWork Society, International Neural NetWork Society, Belarusian State University of Informatics and Radioelectronics (Belarus), Belarusian Academy of Sciences, Institute of Engineering Cybemetics (Belarus), Universidad Politechnica de Valencia (Spain), Institute of Computer Information Technologies (Ukraine, Temrnopil) ; ed. V. Golovko. – Brest : BPI, 1999. – P. 79–84. | ru |
| dc.identifier.uri | https://rep.bstu.by/handle/data/20638 | |
| dc.description.abstract | This paper describes the neural network solving the shortest path planning problem. It consists of the layer set, where each layer forms a path-candidate for the fixed number of cities. During competition the layer-winner determining the sequence order of cities in the shortest path is selected. In this paper the experimental results obtained by the neural network are described in comparison with some known methods solving the same problem. | ru |
| dc.language.iso | en | ru |
| dc.publisher | BPI | ru |
| dc.title | The Approach of the Shortest Path Planning Problem Solution on the Basis of a Neural Network | ru |
| dc.type | Научный доклад (Working Paper) | ru |
