Sökning: "constraint propagation"

Visar resultat 6 - 10 av 21 avhandlingar innehållade orden constraint propagation.

  1. 6. Shape Optimization for Acoustic Wave Propagation Problems

    Författare :Rajitha Udawalpola; Martin Berggren; Pekka Neittaanmäki; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; shape optimization; design optimization; acoustic wave propagation; Helmholtz equation; Boundary Element Method; Finite Element Method; inverse problems; adjoint method; gradient-based optimization; Scientific Computing; Beräkningsvetenskap;

    Sammanfattning : Boundary shape optimization is a technique to search for an optimal shape by modifying the boundary of a device with a pre-specified topology. We consider boundary shape optimization of acoustic horns in loudspeakers and brass wind instruments. LÄS MER

  3. 7. A framework for designing constraint stores

    Författare :Björn Hägglund; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datavetenskap;

    Sammanfattning : A constraint solver based on concurrent search and propagation provides a well-defined component model for propagators by enforcing a strict two-level architecture. This makes it straightforward for third parties to invent, implement and deploy new kinds of propagators. LÄS MER

  4. 8. ICONStraint : a dependency directed constraint maintenance system

    Författare :Jalal Maleki; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Problem solving involves search. In AI we try to find ways of avoiding or minimizing search. An effective approach is to exploit knowledge of the problem domain. Such knowledge often takes the form of a set of constraints. LÄS MER

  5. 9. Integration of Constraint Programming and Integer Programming for Combinatorial Optimization

    Författare :Greger Ottosson; Mats Carlsson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datalogi; Datalogi; Computing Science;

    Sammanfattning : The last several years have seen an increasing interest in combining the models and methods of optimization with those of constraint programming. Integration of the two was initially impeded by their different cultural origins, one having developed largely in the operations research community and the other in the computer science and artificial intelligence communities. LÄS MER

  7. 10. Constraint Programming Methods for Optimization of Single Shortest Path Routing

    Författare :Mats Petter Wallander; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this thesis, we propose methods based on constraint programming (CP) for solving an optimization problem in telecommunications, the single shortest path routing problem. The problem is to find optimal values for a set of routing configuration parameters in a shortest path routing protocol, for a given network. LÄS MER