|
|
Ant Colony Optimization for Solving Big Instances of TSP
Ramosová, Patrícia ; Jaroš, Jiří (oponent) ; Bidlo, Michal (vedoucí práce)
Currently, many applications place emphasis on finding the optimal solution to a particular problem. However, it is typical for some tasks that their complexity increases exponentially depending on the size of the instance. A typical example of such a problem is the Traveling Salesman Problem (TSP). One class of methods that have proven to be very helpful in solving TSPs are ant algorithms. Nonetheless, they reached their limit - a high number of cities in the instance and became almost unusable due to time and memory requirements. This bachelor thesis aims to modify the ant algorithm and create a system capable of quickly and efficiently solve large-scale TSPs without significant loss in the quality of the solution found. Optimization will focus on reducing memory complexity and total execution time.
|
|
|
New functions of client application for DNS protocol for lectures
Ramosová, Patrícia ; Komosný, Dan (oponent) ; Jeřábek, Jan (vedoucí práce)
The aim of this Master thesis entitled New functions of client application for DNS protocol for lectures is to gain understanding of domain name translation protocols, examine the existing clientDNS application, its source codes and compare it with similar existing tools, such as DNS Benchmark, Nslookup and Dig. Based on the performed analysis, new functionality was designed and various errors that the original application contained were identified. After implementing the proposed features and minor improvements, the new version of the DNS client app has been properly tested. The main innovations of the application consist of new modules for DNS over TLS and Link-Local Multicast Name Resolution protocols, and a new module for Mass testing of DNS servers and domain names. Minor improvements consist mainly of a new graphical interface adapted for small and large screens, multi-thread architecture, automatic translation and much more.
|
|
|
New functions of client application for DNS protocol for lectures
Ramosová, Patrícia ; Komosný, Dan (oponent) ; Jeřábek, Jan (vedoucí práce)
The aim of this Master thesis entitled New functions of client application for DNS protocol for lectures is to gain understanding of domain name translation protocols, examine the existing clientDNS application, its source codes and compare it with similar existing tools, such as DNS Benchmark, Nslookup and Dig. Based on the performed analysis, new functionality was designed and various errors that the original application contained were identified. After implementing the proposed features and minor improvements, the new version of the DNS client app has been properly tested. The main innovations of the application consist of new modules for DNS over TLS and Link-Local Multicast Name Resolution protocols, and a new module for Mass testing of DNS servers and domain names. Minor improvements consist mainly of a new graphical interface adapted for small and large screens, multi-thread architecture, automatic translation and much more.
|
|
|
Ant Colony Optimization for Solving Big Instances of TSP
Ramosová, Patrícia ; Jaroš, Jiří (oponent) ; Bidlo, Michal (vedoucí práce)
Currently, many applications place emphasis on finding the optimal solution to a particular problem. However, it is typical for some tasks that their complexity increases exponentially depending on the size of the instance. A typical example of such a problem is the Traveling Salesman Problem (TSP). One class of methods that have proven to be very helpful in solving TSPs are ant algorithms. Nonetheless, they reached their limit - a high number of cities in the instance and became almost unusable due to time and memory requirements. This bachelor thesis aims to modify the ant algorithm and create a system capable of quickly and efficiently solve large-scale TSPs without significant loss in the quality of the solution found. Optimization will focus on reducing memory complexity and total execution time.
|
host ::
RSS.