Sökning: "constraint programming"
Visar resultat 6 - 10 av 89 avhandlingar innehållade orden constraint programming.
6. Analysis, synthesis and application of automaton-based constraint descriptions
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. Other Things Besides Number : Abstraction, Constraint Propagation, and String Variable Types
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
8. Techniques for Efficient Constraint Propagation
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
9. Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search
Sammanfattning : This thesis focuses on constraints for membership in formal languages under both the systematic search and stochastic local search approaches to constraint programming (CP). Such constraints are very useful in CP for the following three reasons: They provide a powerful tool for user-level extensibility of CP languages. LÄS MER
10. Scheduling of embedded real-time systems : a constraint programming approach
Sammanfattning : .... LÄS MER