Home > Search Results: keywords:"optimalizace algoritmů"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 3 records found  Search took 0.00 seconds. 
Search Acceleration in Spatial Structure
 Vlk, Jakub ; Čižmarik, Roman (referee) ; Vlnas, Michal (advisor)
This thesis presents the implementation of a fast nearest neighbor lookup algorithm, which identifies the closest point from a set of points to other points. "The algorithm is scalable for searching for k-neighbors, and it supports the identification of oriented points according to selected criteria and various approaches. The structure offers various approaches and utilizes properties of structures such as Voronoi diagrams, Octree binary search, or hash tables. The complexity of the nearest neighbor search is nearly constant because the cost is logarithmically logarithmic. The thesis shows numerous benchmarks for accuracy and performance.
Detailed record
Traveling Salesman Problem - Serial Methods
 Štys, Jiří ; Bidlo, Michal (referee) ; Kašpárek, Tomáš (advisor)
This bachelor's thesis describes some algorithm which solves traveling salesman problem by the help of serial methods. This thesis deals with efficiency analysis and scalability of this problem.
Detailed record
Traveling Salesman Problem - Serial Methods
 Štys, Jiří ; Bidlo, Michal (referee) ; Kašpárek, Tomáš (advisor)
This bachelor's thesis describes some algorithm which solves traveling salesman problem by the help of serial methods. This thesis deals with efficiency analysis and scalability of this problem.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English