Search for dissertations about: "Constraint"
Showing result 16 - 20 of 569 swedish dissertations containing the word Constraint.
-
16. Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications
Abstract : In this thesis, we will discuss the construction of algorithms for solving Constraint Satisfaction Problems (CSPs), and describe two new ways of approaching them. Both approaches are based on the idea that it is sometimes faster to solve a large number of restricted problems than a single, large, problem. READ MORE
-
17. Set Constraints for Local Search
Abstract : Combinatorial problems are ubiquitous in our society and solving such problems efficiently is often crucial. One technique for solving combinatorial problems is constraint-based local search. Its compositional nature together with its efficiency on large problem instances have made this technique particularly attractive. READ MORE
-
18. Constraint-based Methods for Human-aware Planning
Abstract : As more robots and sensors are deployed in work and home environments, there is a growing need for these devices to act with some degree of autonomy to fulfill their purpose. Automated planning can be used to synthesize plans of action that achieve this. READ MORE
-
19. Ghosts and machines : regularized variational methods for interactive simulations of multibodies with dry frictional contacts
Abstract : A time-discrete formulation of the variational principle of mechanics is used to provide a consistent theoretical framework for the construction and analysis of low order integration methods. These are applied to mechanical systems subject to mixed constraints and dry frictional contacts and impacts---machines. READ MORE
-
20. Symmetry Breaking Ordering Constraints
Abstract : Many problems in business, industry, and academia can be modelled as constraint programs consisting of matrices of decision variables. Such “matrix models” often have symmetry. In particular, they often have row and column symmetry as the rows and columns can freely be permuted without affecting the satisfiability of assignments. READ MORE