National Repository of Grey Literature 3 records found  Search took 0.00 seconds. 
Application for Generating of School Schedules
Fiala, Jan ; Horáček, Jan (referee) ; Rozman, Jaroslav (advisor)
This work deals with problem of generating school schedules. The solution is based on three heuristic algorithms (hill-climbing, simulated annealing, genetic algorithm) and is fully implemented in JAVA. It provides a comparison of implemented heuristic algorithms including description of their pros and cons.
Generic algorithms
Snítilá, Jitka ; Příhoda, Pavel (advisor) ; Jedlička, Přemysl (referee)
This thesis focuses on the lower bounds for generic algorithms for discrete logarithms problem and Diffie-Hellman's problems. This thesis introduces two diffrent models of Black-Box for that purpose. On these models thesis approxi- mates and compares success probability of generic algorithms for given problems including Maurer's reduction. This reduction solves discrete logarithms problem using a appropriate elliptic curve and a Diffie-Hellman's oracle. This thesis also researches generic algorithm for identifiaction schemes, that are based on discrete logarithms problem. 1
Application for Generating of School Schedules
Fiala, Jan ; Horáček, Jan (referee) ; Rozman, Jaroslav (advisor)
This work deals with problem of generating school schedules. The solution is based on three heuristic algorithms (hill-climbing, simulated annealing, genetic algorithm) and is fully implemented in JAVA. It provides a comparison of implemented heuristic algorithms including description of their pros and cons.

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