Sökning: "Constraint"

Visar resultat 16 - 20 av 584 avhandlingar innehållade ordet Constraint.

  1. 16. Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications

    Författare :Ola Angelsmark; Peter Jonsson; Brahim Hnich; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint satisfaction; CSP; graph problems; algorithm construction; computational complexity; microstructures; graph colouring; decision problems; optimisation problems; quantum computing; molecular computing; Computer science; Datavetenskap;

    Sammanfattning : 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. LÄS MER

  3. 17. Set Constraints for Local Search

    Författare :Magnus Ågren; Pierre Flener; Justin Pearson; Gilles Pesant; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; combinatorial problems; constraint-based local search; constraint-directed search; constraint programming; incremental algorithms; monadic existential second-order logic; neighbourhoods; penalty; set variables; set constraints; variable conflicts; Computer science; Datavetenskap; Datavetenskap; Computer Science;

    Sammanfattning : 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. LÄS MER

  4. 18. Constraint-based Methods for Human-aware Planning

    Författare :Uwe Köckemann; Federico Pecora; Lars Karlsson; Paolo Traverso; Örebro universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Task Planning; Constraint-based Planning; Human-aware Planning; Information technology; Informationsteknologi;

    Sammanfattning : 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. LÄS MER

  5. 19. Ghosts and machines : regularized variational methods for interactive simulations of multibodies with dry frictional contacts

    Författare :Claude Lacoursière; Bo Kåggström; Ander Klarbring; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Discrete mechanics; Variational method; Contact problems; Impacts; Least action principle; Saddle point problems; Lagrange Multipliers; Constrained systems; Multibody Systems; Numerical regularization; Constraint realization; Constraint stabilization; Dry friction; Differential Algebraic Equations; Nonsmooth problems; Linear Complementarity; Quaternion algebra; Numerical linear algebra; Physics modeling; Interactive simulation; Numerical stability; Rigid body dynamics; Dissipative systems; Computational physics; Beräkningsfysik;

    Sammanfattning : 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. LÄS MER

  7. 20. Symmetry Breaking Ordering Constraints

    Författare :Zeynep Kiziltan; Andreas Hamfelt; Toby Walsh; Pedro Meseguer; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap; Constraint satisfaction; constraint programming; modelling; symmetry breaking; global constraints; Datavetenskap; Computer science; Datavetenskap;

    Sammanfattning : 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. LÄS MER