Home > Search Results: Ježek, Milan
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. 
Care for Military Veterans in the Czech republic
 JEŽEK, Milan
This bachelor thesis deals with the care for wounded war veterans in the Czech Republic. The first chapter defines the term "war veteran" and specify who and under what legal circumstances becomes a war veteran. Furthermore, the basic division of war veterans, their numbers and their needs are described. The second chapter describes the current system of care for war veterans. It lists the laws and most important documents of the Ministry of Defence that is responsible with care for war veterans. The third chapter describes the existing system of care for war veterans. The third chapter further describes the activities of the Department for War Veterans of the Ministry of Defense as a managing element of care for war veterans. The fourth chapter is devoted to non-departmental organizations that deal with the care for war veterans. The third and fourth chapters are essential for the basic orientation in the current care that is provided to all war veterans. The fifth chapter deals with the current situation of the care for injured war veterans and takes into account departmental and non-departmental inputs into this issue. The goal of the last chapter is to evaluate the current situation. Finally, the findings and suggestions for improving the current state of care for injured war veterans are described.
Detailed record
Modeling of Cooperative Path Finding
 Ježek, Milan ; Surynek, Pavel (advisor) ; Majerech, Vladan (referee)
In this thesis we describe new models for solving the cooperative pathfinding (cpf) with the requirement of minimal makespan and experimental comparison with current models is performed. These new models investigate the possibilities of encoding the cpf problem into binary integer programming (bip) or constraint satisfaction problem (csp). Mainly the new active-edges IP model tests with high number of agents yielded good results, where it fell only slightly behind the best SAT model. A new csp model reached the fastest times in tests with low number of obstacles and agent interactions while struggling heavily in the opposite cases. Powered by TCPDF (www.tcpdf.org)
Detailed record
Modeling of Cooperative Path Finding
 Ježek, Milan ; Surynek, Pavel (advisor) ; Majerech, Vladan (referee)
In this thesis we describe new models for solving the cooperative pathfinding (cpf) with the requirement of minimal makespan and experimental comparison with current models is performed. These new models investigate the possibilities of encoding the cpf problem into binary integer programming (bip) or constraint satisfaction problem (csp). Mainly the new active-edges IP model tests with high number of agents yielded good results, where it fell only slightly behind the best SAT model. A new csp model reached the fastest times in tests with low number of obstacles and agent interactions while struggling heavily in the opposite cases. Powered by TCPDF (www.tcpdf.org)
Detailed record

See also: similar author names
3 JEŽEK, Milan
2 JEŽEK, Mojmír
1 Ježek, Marek
17 Ježek, Martin
1 Ježek, Matyáš
13 Ježek, Michal
1 Ježek, Miloš
1 Ježek, Miroslav
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