Sökning: "Gecode"

Visar resultat 1 - 5 av 10 uppsatser innehållade ordet Gecode.

  1. 1. Implementation and Evaluation of a Sweep-Based Propagator for Diffn in Gecode

    Master-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Mikael Östlund; [2017]
    Nyckelord :;

    Sammanfattning : This thesis builds upon Beldiceanu and Carlsson's sweep-based propagator for a non-overlapping-rectangle constraint. I design and implement a sweep-based propagator for the Diffn constraint, which deals with rectangles generalised to any number of dimensions. Such a constraint is useful in modelling scheduling, assignment, and packing problems. LÄS MER

  3. 2. Implementation and Evaluation of a Compact-Table Propagator in Gecode

    Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Linnea Ingmar; [2017]
    Nyckelord :;

    Sammanfattning : In constraint programming, which is a programming paradigm for solvingcombinatorial(optimisation) problems, relations among variables are expressed using constraints —one suchuseful constraint is Table, which expresses the possible combinations that thevariables cantake as a set of tuples. All constraints have a propagation algorithm, whose purpose istoimplement the reasoning for a particular constraint. LÄS MER

  4. 3. Pre-Runtime Scheduling of an Avionics System

    Master-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Max Block; [2016]
    Nyckelord :;

    Sammanfattning : This master's thesis addresses a scheduling problem arising when designing avionics – the electronic systems used on aircraft. Currently, the problem is commonly solved using mixed integer programming (MIP). We prove the scheduling problem at-hand, which is similar to the well-studied cyclic job shop scheduling problem, is NP-hard. LÄS MER

  5. 4. Implementing Tuple Variables in Gecode

    Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Patrik Broman; [2016]
    Nyckelord :;

    Sammanfattning : In constraint programming, efficient pruning is vital to avoid unnecessary search. This thesis shows that tuple variables can be used to reduce the size of the search tree, which in turn may reduce the execution time. The tuple variables have been implemented in C++ for the Gecode library. LÄS MER

  7. 5. Task scheduling for dual-arm industrial robots through Constraint Programming

    Uppsats för yrkesexamina på avancerad nivå, Lunds universitet/Institutionen för datavetenskap

    Författare :Tommy Kvant; [2015]
    Nyckelord :Constraint Programming; MiniZinc; JaCoP; G12; Gecode; or-tools; Opturion CPX; Choco3; scheduling; dual-arm robots; Technology and Engineering;

    Sammanfattning : In a society where more and more production becomes automated it demands robots that are as flexible and versatile as humans. Such flexibility demands automatic scheduling of tasks. LÄS MER