|
|
Graphical Demonstration of Selected Route Lookup Algorithm
Ohrádka, Marek ; Kaštil, Jan (referee) ; Puš, Viktor (advisor)
This bachelor's thesis deals with IP routing and different routing protocols. It describes different solutions of the longest prefix matching, advantages and disadvantages of different approaches. Shows the concept of the trie data structure and its alternatives. Describes the Shape Shifting Trie data structure in detail, as well as process of its creation and the way of traversing the nodes in SST route lookup algorithm. At last, application design and implementation is described. Main purpose of the application is to graphically demonstrate the function of SST route lookup algorithm. This thesis shows decomposition approach to this task, describes major problems and its solution.
|
|
|
Artificial Intelligence in Strategy Computer Games
Jirout, David ; Gemrot, Jakub (advisor) ; Bída, Michal (referee)
Strategy war games are a genre of computer games with the key element being control and navigation of units on the map. Despite having different approach to unit management, even the best-selling titles usually feature troubles during unit collisions solving with the collisions occurring either among units or between a unit and a natural obstacle. The library being developed in this thesis unifies all the types of approach to unit management being used nowadays and offers generic formation system, prediction, avoidance and/or solving of unit collisions on all levels and furthermore unit pathfinding on the map with both the nature and height profile of the path taken into account. Powered by TCPDF (www.tcpdf.org)
|
|
|
Graphical Demonstration of Selected Route Lookup Algorithm
Ohrádka, Marek ; Kaštil, Jan (referee) ; Puš, Viktor (advisor)
This bachelor's thesis deals with IP routing and different routing protocols. It describes different solutions of the longest prefix matching, advantages and disadvantages of different approaches. Shows the concept of the trie data structure and its alternatives. Describes the Shape Shifting Trie data structure in detail, as well as process of its creation and the way of traversing the nodes in SST route lookup algorithm. At last, application design and implementation is described. Main purpose of the application is to graphically demonstrate the function of SST route lookup algorithm. This thesis shows decomposition approach to this task, describes major problems and its solution.
|
guest ::
