Sökning: "first best solution"
Visar resultat 11 - 15 av 128 avhandlingar innehållade orden first best solution.
11. Logistiskt förändringsarbete : olika ansatser för operativ utveckling
Sammanfattning : During the last decade organizations have been under an increasing pressure to master change, where some key words are increased variability, competition, insecurity and complexity. The new competitive situation sets new and increasing demands on logistical development work and those who conduct it. LÄS MER
12. Integrated Software Pipelining
Sammanfattning : In this thesis we address the problem of integrated software pipelining for clustered VLIW architectures. The phases that are integrated and solved as one combined problem are: cluster assignment, instruction selection, scheduling, register allocation and spilling. LÄS MER
13. Three perspectives on supply chain design
Sammanfattning : As companies increasingly cooperate with and rely on other companies to compete on a global market, the concept of supply chain management and logistics is gaining interest, from practitioner as well as researchers. Studies of high-performing companies, such as Benetton, Toyota and Nissan report that these organizations take a strategic view of the whole process of supply from original sources of material to end customers, achieving more efficient operations management and more effective strategic management. LÄS MER
14. Data association algorithms and metric design for trajectory estimation
Sammanfattning : This thesis is concerned with trajectory estimation, which finds applications in various fields such as automotive safety and air traffic surveillance. More specifically, the thesis focuses on the data association part of the problem, for single and multiple targets, and on performance metrics. LÄS MER
15. Asynchronous Algorithms for Large-Scale Optimization : Analysis and Implementation
Sammanfattning : This thesis proposes and analyzes several first-order methods for convex optimization, designed for parallel implementation in shared and distributed memory architectures. The theoretical focus is on designing algorithms that can run asynchronously, allowing computing nodes to execute their tasks with stale information without jeopardizing convergence to the optimal solution. LÄS MER