Národní úložiště šedé literatury Nalezeno 2 záznamů.  Hledání trvalo 0.01 vteřin. 
Solving Canadian Traveller Problem
Pavlovič, Dávid ; Šoustek, Petr (oponent) ; Dvořák, Jiří (vedoucí práce)
This thesis deals with Canadian traveller problem. Imagine a traveller that have a map on which every road is associated with time that is needed to get through this road. Hovewer, this map may not be totally reliable, and the time needed to pass through on some of the roads may be different due to bad road conditions, or the pass will be impossible. This thesis deals with type overview of this problem and the solutions. Further, the thesis deals with the description of two applications implemented in Python, which serves on verification of the strategies. The final part contains experiments and comparison of effectiveness of selected strategies.
Solving Canadian Traveller Problem
Pavlovič, Dávid ; Šoustek, Petr (oponent) ; Dvořák, Jiří (vedoucí práce)
This thesis deals with Canadian traveller problem. Imagine a traveller that have a map on which every road is associated with time that is needed to get through this road. Hovewer, this map may not be totally reliable, and the time needed to pass through on some of the roads may be different due to bad road conditions, or the pass will be impossible. This thesis deals with type overview of this problem and the solutions. Further, the thesis deals with the description of two applications implemented in Python, which serves on verification of the strategies. The final part contains experiments and comparison of effectiveness of selected strategies.

Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.