Sökning: "Parallel heuristic search algorithms"
Hittade 5 avhandlingar innehållade orden Parallel heuristic search algorithms.
1. Parallel algorithms for solving the train timetable rescheduling problem
Sammanfattning : In railways, it is essential to achieve high train punctuality. Thus, whenever disturbances occur, it is important to reschedule the trains effectively. This task is typically handled manually by traffic controllers in real-time. LÄS MER
2. Parallel algorithms for real-time railway rescheduling
Sammanfattning : In railway traffic systems, it is essential to achieve a high punctuality to satisfy the goals of the involved stakeholders. Thus, whenever disturbances occur, it is important to effectively reschedule trains while considering the perspectives of various stakeholders. LÄS MER
3. JOINING SEQUENCE ANALYSIS AND OPTIMIZATION FOR IMPROVED GEOMETRICAL QUALITY
Sammanfattning : Disturbances in the manufacturing and assembly processes cause geometrical variation from the ideal geometry. This variation eventually results in functional and aesthetic problems in the final product. Being able to control the disturbances is the desire of the manufacturing industry. LÄS MER
4. Performance Engineering of Mobile Broadband : Capacity Analysis, Cellular Network Optimization, and Design of In-Building Solutions
Sammanfattning : The rapid evolution of mobile communication technologies is making mobile broadband a reality. With over 6 billion cellular connections and the booming of mobile data, mobile broadband leads the technology and service innovation within the domain of information and communication technologies. LÄS MER
5. A Study of Combinatorial Optimization Problems in Industrial Computer Systems
Sammanfattning : A combinatorial optimization problem is an optimization problem where the number of possible solutions are finite and grow combinatorially with the problem size. Combinatorial problems exist everywhere in industrial systems. LÄS MER