Home > Search Results: keywords:"Parallel solution"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Traveling Salesman Problem - Parallel Methods Using SMP (OpenMP)
 Hruška, Michal ; Jaroš, Jiří (referee) ; Kašpárek, Tomáš (advisor)
Thesis compares serial and parallel methods for solving traveling salesman problem. Some of the well-known heuristics are used. These have been tested for long hours. Time and space complexity are used as comparing measure. It was discovered that small part of ACO source code in parallel is going to speed up the code according to Amdahl's law.
Detailed record
Traveling Salesman Problem - Parallel Methods Using SMP (OpenMP)
 Hruška, Michal ; Jaroš, Jiří (referee) ; Kašpárek, Tomáš (advisor)
Thesis compares serial and parallel methods for solving traveling salesman problem. Some of the well-known heuristics are used. These have been tested for long hours. Time and space complexity are used as comparing measure. It was discovered that small part of ACO source code in parallel is going to speed up the code according to Amdahl's law.
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