Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem
This study is concerned with a novel Monte Carlo Tree Search algorithm for the problem of minimal Euclidean Steiner tree on a plane. Given p p p points (terminals) on a plane, the goal is to find a connection between all the points, so that the total sum of the lengths of edges is as low as possible,...
Uložené v:
| Vydané v: | Journal of Telecommunications and Information Technology Ročník 4; číslo 2017; s. 71 - 81 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
National Institute of Telecommunications
01.01.2018
|
| Predmet: | |
| ISSN: | 1509-4553, 1899-8852 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!