Sökning: "constraint programming"

Visar resultat 21 - 25 av 89 avhandlingar innehållade orden constraint programming.

  1. 21. Model Order Reduction Based on Semidefinite Programming

    Författare :Aivar Sootla; Institutionen för reglerteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; model reduction; parameterized model reduction; nu-gap metric; semidefinite programming; frequency response matching.;

    Sammanfattning : The main topic of this PhD thesis is complexity reduction of linear time-invariant models. The complexity in such systems is measured by the number of differential equations forming the dynamical system. This number is called the order of the system. LÄS MER

  3. 22. Integrated Register Allocation and Instruction Scheduling with Constraint Programming

    Författare :Roberto Castañeda Lozano; Christian Schulte; Mats Carlsson; Ingo Sander; Peter van Beek; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Computer Science; Datalogi;

    Sammanfattning : This dissertation proposes a combinatorial model, program representations, and constraint solving techniques for integrated register allocation and instruction scheduling in compiler back-ends. In contrast to traditional compilers based on heuristics, the proposed approach generates potentially optimal code by considering all trade-offs between interdependent decisions as a single optimization problem. LÄS MER

  4. 23. The Tail Assignment Problem

    Författare :Mattias Grönkvist; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; hybrid optimization; fleet planning; aircraft routing; column generation; airline optimization; tail assignment; constraint programming;

    Sammanfattning : The Aircraft Assignment problem is the problem of assigning flights to aircraft in such a way that some operational constraints are satisfied, and possibly that some objective function is optimized.We propose an approach to aircraft assignment which captures all operational constraints, including minimum connection times, airport curfews, maintenance, and preassigned activities. LÄS MER

  5. 24. Universal Instruction Selection

    Författare :Gabriel Hjort Blindell; Christian Schulte; Peter van Beek; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; instruction selection; code generation; compilers; constraint programming; combinatorial optimization; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : In code generation, instruction selection chooses instructions to implement a given program under compilation, global code motion moves computations from one part of the program to another, and block ordering places program blocks in a consecutive sequence. Local instruction selection chooses instructions one program block at a time while global instruction selection does so for the entire function. LÄS MER

  7. 25. Constraint Programming Methods for Optimization of Single Shortest Path Routing

    Författare :Mats Petter Wallander; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this thesis, we propose methods based on constraint programming (CP) for solving an optimization problem in telecommunications, the single shortest path routing problem. The problem is to find optimal values for a set of routing configuration parameters in a shortest path routing protocol, for a given network. LÄS MER