Essays about: "Constraint Solving Problems"
Showing result 16 - 20 of 24 essays containing the words Constraint Solving Problems.
-
16. Parallel Portfolio Search for Gecode
University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)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
-
17. Integrating Context Inference and Planning in a Network Robot System
University essay from Örebro universitet/Institutionen för naturvetenskap och teknikAbstract : 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
-
18. Route Optimisation for Winter Road Maintenance using Constraint Modelling
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : 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
-
19. Convex Optimization Methods for System Identification
University essay from Linnéuniversitetet/Institutionen för fysik och elektroteknik (IFE)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
-
20. The First Constraint-Based Local Search Backend for MiniZinc
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : MiniZinc is a modelling language used to model combinatorial optimisation and satisfaction problems, which can then be solved in a backend solver. There are many different backend solvers based on different technologies such as constraint programming, mathematical programming, or Boolean satisfiability solving. READ MORE