Sökning: "Constraint"

Visar resultat 1 - 5 av 583 avhandlingar innehållade ordet Constraint.

1. 1. Parallelism in Constraint Programming

   Författare :Carl Christian Rolf; Institutionen för datavetenskap; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Parallelism; Constraint Programming; Parallel Consistency; Parallel Search; Distributed Constraint Programming;

   Sammanfattning : Writing efficient parallel programs is the biggest challenge of the software industry for the foreseeable future. We are currently in a time when parallel computers are the norm, not the exception. Soon, parallel processors will be standard even in cell phones. LÄS MER

3. 2. 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

4. 3. Other Things Besides Number : Abstraction, Constraint Propagation, and String Variable Types

   Författare :Joseph Scott; Pierre Flener; Parosh Abdulla; Justin Pearson; Michel Rueher; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint programming; string constraint problems; Galois connections; abstraction; constraint propagation; computer-aided verification applications; Datavetenskap; Computer Science;

   Sammanfattning : Constraint programming (CP) is a technology in which a combinatorial problem is modeled declaratively as a conjunction of constraints, each of which captures some of the combinatorial substructure of the problem. Constraints are more than a modeling convenience: every constraint is partially implemented by an inference algorithm, called a propagator, that rules out some but not necessarily all infeasible candidate values of one or more unknowns in the scope of the constraint. LÄS MER

5. 4. Function Variables for Constraint Programming

   Författare :Brahim Hnich; Edward Tsang; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Constraint saisfaction; constraint programming; high-level modelling; abstraction; reformulation; function variables.; Datalogi; Computer science; Datalogi; Computer Science; data- och systemvetenskap;

   Sammanfattning : Quite often modelers with constraint programming (CP) use the same modelling patterns for different problems, possibly from different domains. This results in recurring idioms in constraint programs. Our approach can be seen as a three-step approach. First, we identify some of these recurring patterns in constraint programs. LÄS MER

7. 5. Techniques for Efficient Constraint Propagation

   Författare :Mikael Zayenz Lagerkvist; Seif Haridi; Christian Schulte; Pierre Flener; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint programming; constraint propagation; optimization; Computer science; Datalogi;

   Sammanfattning : This thesis explores three new techniques for increasing the efficiency of constraint propagation: support for incremental propagation, improved representation of constraints, and abstractions to simplify propagation.  Support for incremental propagation is added to a propagator centered propagation system by adding a new intermediate layer of abstraction, advisors, that capture the essential aspects of a variable centered system. LÄS MER