Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"Distributed Constraint Optimization"”.

  1. Dynamic Continuous Distributed Constraint Optimization Problems

    The Distributed Constraint Optimization Problem (DCOP) formulation is a powerful tool to model multi-agent coordination problems that are distributed by nature. The formulation is suitable for problems where the environment does not change over time and where agents seek their value assignment from …

    wustl Repository record for Dynamic Continuous Distributed Constraint Optimization Problems (opens in a new tab)

  2. Distributed constraint optimization, resource allocation and scheduling in large scale agent networks

    … reorganization of agent groups and distributed constraint optimizationmethods. After a complex task has been broken down into subtasks, constraints thatmay exist between the derived subtasks or constraints inherent to the resourceallocation procedure are modelled as a distributed …

    greece Repository record for Distributed constraint optimization, resource allocation and scheduling in large scale agent networks (opens in a new tab)

  3. Speeding up GDL-based distributed constraint optimization algorithms in cooperative multi-agent systems

    … algorithms that are developed to process constraints in multi-agent systems. In particular, Distributed Constraint Optimization Problems (DCOPs) are a widely studied constraint handling framework for coordinating interactions in cooperative multi-agent systems. For the past decade, a …

    soton Download PDF for Speeding up GDL-based distributed constraint optimization algorithms in cooperative multi-agent systems (opens in a new tab)

  4. Embedding Preference Elicitation Within the Search for DCOP Solutions

    The Distributed Constraint Optimization Problem(DCOP)formulation is a powerful tool to model cooperative multi-agent problems, especially when they are sparsely constrained with one another. A key assumption in this model is that all constraints are fully specified or known a priori, which may not …

    wustl Repository record for Embedding Preference Elicitation Within the Search for DCOP Solutions (opens in a new tab)

  5. Comparação de algoritmos para otimização de restrições distribuídas em um cenário de controle semafórico

    … de otimização de restrições distribuídas (DCOP - Distributed Constraint Optimization Problem) formam uma classe de problemas de grande interesse de estudo na ciência da computação em função da complexidadecomputacionaL O presente trabalho tem o objetivo de comparar os três algoritmos mais …

    brazil-ufrgs Repository record for Comparação de algoritmos para otimização de restrições distribuídas em um cenário de controle semafórico (opens in a new tab)

  6. Evaluation and Adaptation of a Constraint Optimization and Distributed, Anytime A* Algorithm to Design-To-Criteria Scheduling Problem

    … complex scheduling problems, and propose two new optimization techniques, which exploit A* based optimization, and constraint based optimization. We then perform an analytical comparison and computational complexity estimate for the efficiency enhancement achieved by these approaches, as compared …

    texas-state Repository record for Evaluation and Adaptation of a Constraint Optimization and Distributed, Anytime A* Algorithm to Design-To-Criteria Scheduling Problem (opens in a new tab)

  7. Decentralised control of wireless sensor networks

    … optimal decentralised algorithms to solve this distributed constraint optimization problem. The first assumes that the route by which data is forwarded to the base station is fixed (either because the underlying communication network is a tree, or because an arbitrary choice of route has been …

    soton Download PDF for Decentralised control of wireless sensor networks (opens in a new tab)

  8. Preference Elicitation in Constraint-Based Models: Models, Algorithms, and Applications

    Constraint-based models offer powerful approaches for describing and resolving many combinatorial optimization problems in a centralized or distributed environment. In such models, the goal is to find a value assignment to a set of variables given a set of preferences expressed by means of cost …

    wustl Repository record for Preference Elicitation in Constraint-Based Models: Models, Algorithms, and Applications (opens in a new tab)

  9. Distributed Target Engagement in Large-scale Mobile Sensor Networks

    … and coordination approach, and a hierarchical Distributed Constraint Optimization Problem (DCOP) modelling algorithm, as an allocation approach, to tackle target engagement problem in large-scale mobile multi-target multi-sensor surveillance systems. Sensor-to-target allocation is an NP-hard …

    waterloo Repository record for Distributed Target Engagement in Large-scale Mobile Sensor Networks (opens in a new tab)