Asynchronous forward bounding revisited
Abstract The Distributed Constraint Optimization Problem (DCOP) is a powerful framework
for modeling and solving applications in multi-agent coordination. Asynchronous Forward …
for modeling and solving applications in multi-agent coordination. Asynchronous Forward …
The impact of wireless communication on distributed constraint satisfaction
Distributed constraint satisfaction (DisCSP) models decision problems where physically
distributed agents control different decision variables, but must communicate with each other …
distributed agents control different decision variables, but must communicate with each other …
A colored Petri net model for DisCSP algorithms
The aim of this paper is to present a colored Petri net that models a system applying a
DisCSP method. Our study considered 3 representative DisCSP algorithms: synchronous …
DisCSP method. Our study considered 3 representative DisCSP algorithms: synchronous …
Contribution to modeling smart grid problem with the constraint satisfaction problem formalism
G El Khattabi, S Lahboub, B El Houssine… - Proceedings of the 2nd …, 2018 - dl.acm.org
Smart Grids are electricity distribution networks that use intelligent IT methods to match the
adequacy between consumer demand and provider offer (electric power plants and various …
adequacy between consumer demand and provider offer (electric power plants and various …
Solving DCSP problems in highly degraded communication environments
S Samadidana, R Mailler - … of the International Conference on Web …, 2017 - dl.acm.org
Although there have been tremendous gains in network communication reliability, many real
world applications of distributed systems still face message loss, limitations, delay, and …
world applications of distributed systems still face message loss, limitations, delay, and …
Maintaining ethical resolution in distributed constraint reasoning
Multi-agent systems (MAS) consist of autonomous agents that parcel out different tasks and
make decisions in dynamic environments. Distributed constraint satisfaction problem …
make decisions in dynamic environments. Distributed constraint satisfaction problem …
Global constraints in Distributed CSP: Concurrent GAC and explanations in ABT
The expressiveness of Distributed CSP has been recently enhanced to include global
constraints. Careful reformulation of contractible global constraints has been shown to …
constraints. Careful reformulation of contractible global constraints has been shown to …
Detection of unethical intelligent agents in ethical distributed constraint satisfaction problems
Ethics has become the most interesting research field in artificial intelligence, it has been
considered in several areas such as intelligent military applications, private data systems …
considered in several areas such as intelligent military applications, private data systems …
A distributed optimization method for the geographically distributed data centres problem
The geographically distributed data centres problem (GDDC) is a naturally distributed
resource allocation problem. The problem involves allocating a set of virtual machines (VM) …
resource allocation problem. The problem involves allocating a set of virtual machines (VM) …
Maintaining arc consistency asynchronously in synchronous distributed search
We recently proposed No good-Based Asynchronous Forward Checking (AFC-ng), an
efficient and robust algorithm for solving Distributed Constraint Satisfaction Problems …
efficient and robust algorithm for solving Distributed Constraint Satisfaction Problems …