Essays about: "tabu"
Showing result 16 - 20 of 41 essays containing the word tabu.
-
16. Automated decision support for placing terrain observers
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Access to reliable information is key for military decision-making. Reconnaissance assets are used to gather information about the Operational Environment. These assets need to be placed within the terrain so that they can see as much of the area of interest as possible. The manual task of placing assets within the terrain is a time-consuming task. READ MORE
-
17. A Comparison of a Heuristic and a Hopfield Neural Network Approach for Solving Examination Timetabling Problems
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The Examination Timetabling Problem (ETP) is the problem of scheduling a number of exams during a set time period so that no students are required to sit two exams simultaneously. Despite the complexity of the problem, universities all over the world solve ETPs several times each year. READ MORE
-
18. Performance Optimizing Priority Assignment in Embedded Soft Real-time Applications
University essay from Linköpings universitet/Programvara och systemAbstract : Optimizing task priority assignments is a well-researched area in the context of hard real-time systems, where the goal in the majority of cases is to produce a priority assignment that results in a schedulable task set. The problem has also been considered, albeit not to the same extent, in the soft real-time context where quality of service metrics determine the overall performance of systems. READ MORE
-
19. Local search hybridization of a genetic algorithm for solving the University Course Timetabling Problem
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The University Course Timetabling Problem (UCTP) is the problem of assigning locations (lecture halls, computer rooms) and time slots (time and date) to a set of events (lectures, labs) while satisfying a number of constraints such as avoiding double-bookings. Many variants of problem formulations exist, and most realistic variants are thought to be NP-hard. READ MORE
-
20. A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem
University essay from Linköpings universitet/Artificiell intelligens och integrerade datorsystemAbstract : This study aims to answer whether a heuristic that trades cycles between the tours in a solution would show good results when trying to solve the Weighted k-Chinese Postman Problem for undirected graphs, of varying size, representing neighbourhoods in Sweden.A tabu search heuristic was implemented with each iteration consisting of giving a cycle from the most expensive tour to the cheapest. READ MORE