Essays about: "Constraint Solving Problems"

Showing result 21 - 25 of 30 essays containing the words Constraint Solving Problems.

  1. 21. Evaluation and Implementation of Dominance Breaking Presolving Techniques in the Unison Compiler Back-End

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

    Author : Mikael Almgren; [2015]
    Keywords : ;

    Abstract : Constraint-based compiler back-ends use constraint programming to solve some of the translation stages that a compiler back-end typically is constructed of. Using constraint programming enables the compiler to generate optimal target code that is faster and more robust compared to code generated by a traditional compiler back-end. READ MORE

  3. 22. Parallel Portfolio Search for Gecode

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

    Author : Anton From; [2015]
    Keywords : Constraint programming; Gecode; Parallel portfolio search; Villkorsprogrammering; Gecode; Parallel portföljsökning;

    Abstract : Constraint programming is used to solve hard combinatorial problems in a variety of domains, such as scheduling, networks and bioinformatics. Search for solving these problems in constraint programming is brittle and even slight variations in the problem data or search heuristic used can dramatically affect the runtime. READ MORE

  4. 23. Integrating Context Inference and Planning in a Network Robot System

    University essay from Örebro universitet/Institutionen för naturvetenskap och teknik

    Author : Stefano Natali; [2015]
    Keywords : ;

    Abstract : Context Inference and Planning are becoming more and more valuable in robot oriented technology and several artificial intelligence techniques exist for solving both context inference and planning problems. However, not many combinations of context inference and planning solving have been tried and evaluated as well as comparison between these combinations. READ MORE

  5. 24. Route Optimisation for Winter Road Maintenance using Constraint Modelling

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Emil Kajgård; [2015]
    Keywords : ;

    Abstract : Planning of routes for the many kinds of road maintenance problems is essential. These problems can be generalised to the vehicle routing problem, where a num- ber of available vehicles should be assigned to objectives in an optimised order. READ MORE

  6. 25. Convex Optimization Methods for System Identification

    University essay from Linnéuniversitetet/Institutionen för fysik och elektroteknik (IFE)

    Author : Dino Dautbegovic; [2014]
    Keywords : Mathematical Optimization; Convex Optimization; Least-Squares; LTI-System; System Identification; Inverse System;

    Abstract : The extensive use of a least-squares problem formulation in many fields is partly motivated by the existence of an analytic solution formula which makes the theory comprehensible and readily applicable, but also easily embedded in computer-aided design or analysis tools. While the mathematics behind convex optimization has been studied for about a century, several recent researches have stimulated a new interest in the topic. READ MORE