Essays about: "Villkorsprogrammering"

Showing result 1 - 5 of 8 essays containing the word Villkorsprogrammering.

  1. 1. Effects of Design Space Discretization on Constraint Based Design Space Exploration

    University essay from KTH/Matematik (Avd.)

    Author : Ludwig Karlsson; [2023]
    Keywords : Constraint programming; Design space exploration; Discretization; Multiresolutional analysis; Villkorsprogrammering; Designrymdsutforskning; Diskretisering; Multiupplösningsanalys;

    Abstract : Design Space Exploration (DSE) is the exploration of a space of possible designs with the goal of finding some optimal design according to some constraints and criteria. Within embedded systems design, automated DSE in particular can allow the system designer to efficiently find good solutions in highly complex design spaces. READ MORE

  2. 2. Applicability of Constraint Solving and Simulated Annealing to Real-World Scale University Course Timetabling Problems

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Felix Almay; Oskar Strömberg; [2019]
    Keywords : ;

    Abstract : The university course timetabling problem is the problem of creating a schedule for university courses under certain constraints. The decision variant of this optimisation problem is NP-complete. We have researched this problem and implemented the heuristic simulated annealing. READ MORE

  3. 3. Towards Arc Consistency in PLAS

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : William Wieweg; [2018]
    Keywords : Constraint Programming; Scheduling; Planning; Symbolic constraints; Arc consistency; Villkorsprogrammering; Schemaläggning; Planering; Symboliska villkor; Bågkonsekvens;

    Abstract : The Planning And Scheduling (PLAS) module of ICE (Intelligent Control Environment) is responsible for planning and scheduling a large fleet of vehicles. This process involves the creation of tasks to be executed by the vehicles. READ MORE

  4. 4. A Systematic Approach to Automated Software Diversity Using Unison

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Patrik Karlström; [2018]
    Keywords : ;

    Abstract : Unison is a tool that combines instruction scheduling and register allocation as a single combinatorial problem and solves it using constraint programming, which is a programming paradigm for systematically solving combinatorial problems. Automated software diversity is the process of automatically providing diverse executables in an effort to break so called gadgets, which are short instruction sequences that together make up an attack vector. READ MORE

  5. 5. Implied Constraints for the Unison Presolver

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Erik Ekström; [2015]
    Keywords : ;

    Abstract : Unison is a compiler back-end that differs from traditional compiler approaches in that the compilation is carried out using constraint programming rather than greedy algorithms. The compilation problem is translated to a constraint model and then solved using a constraint solver, yielding an approach that has the potential of producing optimal code. READ MORE