Sökning: "Distributed Constraint Programming"

Visar resultat 1 - 5 av 7 avhandlingar innehållade orden Distributed 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

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

  3. 3. Exploiting Fine-grain Parallelism in Concurrent Constraint Languages

    Författare :Johan Montelius; RISE; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Implicit parallelism; Concurrent Constraint Programming; Cache performance; Logic programming; Abstract machine; Parallel execution; Scheduling; Multiprocessor; Shared memory;

    Sammanfattning : This dissertation presents the design, implementation, and evaluation of a system that exploits fine-grain implicit parallelism in concurrent constraint programming language. The system is able to outperform a C implementation of an algorithm with complex dependencies without any user annotations. LÄS MER

  4. 4. Managing the Complexity in Embedded and Cyber-Physical System Design : System Modeling and Design-Space Exploration

    Författare :Seyed Hosein Attarzadeh Niaki; Ingo Sander; Christian Haubelt; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : To cope with the increasing complexity of embedded and cyber-physical system design, different system-level design approaches are proposed which start from abstract models and implement them using design flows with high degrees of automation. However, creating models of such systems and also formulating the mathematical problems arising in these design flows are themselves challenging tasks. LÄS MER

  5. 5. Accelerating Convergence of Large-scale Optimization Algorithms

    Författare :Euhanna Ghadimi; Mikael Johansson; Angelia Nedich; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Convex optimization; Large-scale systems; First-order methods; Convergence analysis; ADMM; Optimization algorithms; Electrical Engineering; Elektro- och systemteknik; Matematik; Mathematics;

    Sammanfattning : Several recent engineering applications in multi-agent systems, communication networks, and machine learning deal with decision problems that can be formulated as optimization problems. For many of these problems, new constraints limit the usefulness of traditional optimization algorithms. LÄS MER