Avancerad sökning
Visar resultat 1 - 5 av 21 avhandlingar som matchar ovanstående sökkriterier.
1. 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
2. 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
3. Cost Propagation - Numerical Propagation for Optimization Problems
Sammanfattning : In this thesis, we investigate Cost Propagation,an approach to numerical propagation for optimization problems, where we combine ideas from both Constraint Programming and Combinatorial Optimization. We consider discrete optimization problems with binary variables that can be expressed in the model max_x sum_k g_k(x^k)where the terms g_k(x^k) are distinct arbitrary functions over subsets x^k of x. LÄS MER
4. 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
5. Computational Solid Wave Propagation Numerical Techniques and Industrial Applications
Sammanfattning : For wave propagation and many other physical phenomena, the dynamic effects are vital. In industrial applications, such problems are very complex and generally have to be treated by means of numerical methods. LÄS MER