Sökning: "Constraint Programming"

Visar resultat 1 - 5 av 89 avhandlingar innehållade orden Constraint Programming.

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

  4. 3. Constraint Programming for Wireless Sensor Networks

    Författare :Farshid Hassani Bijarbooneh; Justin Pearson; Pierre Flener; Edith Ngai; Ken Brown; Uppsala universitet; []
    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

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

    Författare :Max Åstrand; Mikael Johansson; Christian Schulte; KTH; []
    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

  7. 5. Short-term Underground Mine Scheduling : An Industrial Application of Constraint Programming

    Författare :Max Åstrand; Mikael Johansson; Mats Carlsson; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; scheduling; mining; underground mines; constraint programming; large neighborhood search; korttidsplanering; gruvdrift; underjordsgruvor; villkorsprogrammering; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : The mining industry is facing a surge in automation in the pursuit of safe and profitable operations. As the excavation process is increasingly automated, today's mining companies seek to optimize the coordination of the now automated mining activities. LÄS MER