National Repository of Grey Literature 4 records found  Search took 0.01 seconds. 
Evolutionary Algorithms for the Solution of Travelling Salesman Problem
Jurčík, Lukáš ; Budík, Jan (referee) ; Dostál, Petr (advisor)
This diploma thesis deals with evolutionary algorithms used for travelling salesman problem (TSP). In the first section, there are theoretical foundations of a graph theory and computational complexity theory. Next section contains a description of chosen optimization algorithms. The aim of the diploma thesis is to implement an application that solve TSP using evolutionary algorithms.
3D Game Using WebGL - Inball
Jurčík, Lukáš ; Navrátil, Jan (referee) ; Szentandrási, István (advisor)
This bachelor thesis outlines the possibilities of making 3D applications in web-browsers, focusing on computer games. First, different methods of creating games inside web-browsers are briefly introduced. Next section contains a description of WebGL's frameworks and physics in games. The aim of this work was to design and implement a 3D browser game called Inball based on games like Neverball and Ballance. The application is based on WebGL technology using Three.js of frameworks encapsulating WebGL.
3D Game Using WebGL - Inball
Jurčík, Lukáš ; Navrátil, Jan (referee) ; Szentandrási, István (advisor)
This bachelor thesis outlines the possibilities of making 3D applications in web-browsers, focusing on computer games. First, different methods of creating games inside web-browsers are briefly introduced. Next section contains a description of WebGL's frameworks and physics in games. The aim of this work was to design and implement a 3D browser game called Inball based on games like Neverball and Ballance. The application is based on WebGL technology using Three.js of frameworks encapsulating WebGL.
Evolutionary Algorithms for the Solution of Travelling Salesman Problem
Jurčík, Lukáš ; Budík, Jan (referee) ; Dostál, Petr (advisor)
This diploma thesis deals with evolutionary algorithms used for travelling salesman problem (TSP). In the first section, there are theoretical foundations of a graph theory and computational complexity theory. Next section contains a description of chosen optimization algorithms. The aim of the diploma thesis is to implement an application that solve TSP using evolutionary algorithms.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.