Skip to search formSkip to main contentSkip to account menu

Distributed constraint optimization

Known as: DPOP, Distributed Graph Coloring, OptAPO 
Distributed constraint optimization (DCOP or DisCOP) is the distributed analogue to constraint optimization. A DCOP is a problem in which a group of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The Distributed Breakout Algorithm (DBA) is a local search algorithm that was originally designed to solve DisCSPs and DisMaxCSPs… 
2015
2015
Distributed Constraint Optimization Problems (DCOPs) are problems where agents need to coordinate their value assignments to… 
2011
2011
Distributed Constraint Satisfaction (DisCSP) and Distributed Constraint Optimization (DCOP) are formal frameworks that can be… 
2009
2009
The standard model of distributed constraints optimization problems (DCOPs), assumes that the cost of a constraint is checked by… 
2008
2008
Complete algorithms for solving DisCOPs have been a major focus of research in the DCR community in the last few years. The… 
2008
2008
In recent years the electricity sector has undergone a number of changes that all point in the direction of liberalization and… 
2004
2004
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent… 
2003
2003
We consider three distributed configuration tasks that arise in the setup and operation of multi-hop wireless networks: partition… 
2001
2001
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation…