Sökning: "constraint programming"

Visar resultat 1 - 5 av 69 avhandlingar innehållade orden constraint programming.

  1. 1. Parallelism in Constraint Programming

    Författare :Carl Christian Rolf; Lunds universitet.; Lund University.; Lunds universitet.; Lund University.; [2011]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Parallelism; Constraint Programming; Parallel Consistency; Parallel Search; Distributed Constraint Programming;

    Sammanfattning : Popular Abstract in English At our workplace, at home, and on the road, we rely on software. It has become one of the central technologies on which we base our society. Yet, software is perhaps the major technology that is understood the least by the general population. LÄS MER

  2. 2. Function Variables for Constraint Programming

    Detta är en avhandling från Uppsala : Institutionen för informationsvetenskap

    Författare :Brahim Hnich; Uppsala universitet.; [2003]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Constraint saisfaction; constraint programming; high-level modelling; abstraction; reformulation; function variables.; Datalogi; TECHNOLOGY Information technology Computer science Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap 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

  3. 3. Constraint Programming for Wireless Sensor Networks

    Detta är en avhandling från Uppsala : Acta Universitatis Upsaliensis

    Författare :Farshid Hassani Bijarbooneh; Uppsala universitet.; Uppsala universitet.; [2015]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Constraint programming; wireless sensor networks; optimisation; macroprogramming; task mapping; Datavetenskap med inriktning mot datorkommunikation; Computer Science with specialization in Computer Communication;

    Sammanfattning : In recent years, wireless sensor networks (WSNs) have grown rapidly and have had a substantial impact in many applications. A WSN is a network that consists of interconnected autonomous nodes that monitor physical and environmental conditions, such as temperature, humidity, pollution, etc. LÄS MER

  4. 4. Short-term Underground Mine Scheduling Constraint Programming in an Industrial Application

    Detta är en avhandling från Stockholm : KTH Royal Institute of Technology

    Författare :Max Åstrand; KTH.; [2018]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; scheduling; mining; mine; underground; constraint programming; cp; large neighborhood search; lns; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : The operational performance of an underground mine depends critically on how the production is scheduled. Increasingly advanced methods are used to create optimized long-term plans, and simultaneously the actual excavation is getting more and more automated. LÄS MER

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

    Detta är en avhandling från Uppsala : Acta Universitatis Upsaliensis

    Författare :María Andreína Francisco Rodríguez; Uppsala universitet.; Uppsala universitet.; [2017]
    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