Sökning: "set constraints"

Visar resultat 1 - 5 av 377 avhandlingar innehållade orden set constraints.

  1. 1. 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

  3. 2. Set Constraints for Local Search

    Författare :Magnus Ågren; RISE; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : .... LÄS MER

  4. 3. On low order controller synthesis using rational constraints

    Författare :Daniel Ankelhed; Anders Hansson; Anders Helmersson; Anders Forsgren; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; H-infinity synthesis; Linear Matrix Inequalities; rank constraints; polynomial constraints; interior point methods; Automatic control; Reglerteknik;

    Sammanfattning : In order to design robust controllers, H-infinity synthesis is a common tool to use. The controllers that result from these algorithms are typically of very high order, which complicates implementation. LÄS MER

  5. 4. Analysis, synthesis and application of automaton-based constraint descriptions

    Författare :María Andreína Francisco Rodríguez; Justin Pearson; Pierre Flener; Christopher Jefferson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint programming; constraint predicates; global constraints; automata; automaton-described constraint predicates; automaton-induced constraint decompositions; implied constraints; time-series constraints; transducers; automaton invariants; Computer Science; Datavetenskap;

    Sammanfattning : Constraint programming (CP) is a technology in which a combinatorial problem is modelled as a conjunction of constraints on variables ranging over given initial domains, and optionally an objective function on the variables. Such a model is given to a general-purpose solver performing systematic search to find constraint-satisfying domain values for the variables, giving an optimal value to the objective function. LÄS MER

  7. 5. Applications of the Virtual Holonomic Constraints Approach : Analysis of Human Motor Patterns and Passive Walking Gaits

    Författare :Uwe Mettin; Anton Shiriaev; Umeå universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Motion Planning; Humanoid Robots; Virtual Holonomic Constraints; Underactuated Mechanical Systems; Mechanical Springs; Automatic control; Reglerteknik;

    Sammanfattning : In the field of robotics there is a great interest in developing strategies and algorithms to reproduce human-like behavior. One can think of human-like machines that may replace humans in hazardous working areas, perform enduring assembly tasks, serve the elderly and handicapped, etc. LÄS MER