Abstract Depth First Search (DFS) pseudo-tree is popularly used as the communication
structure in complete algorithms for solving Distributed Constraint Optimization Problems …

Present manufacturing systems are facing significant challenges concerning their
adaptability. Holonic manufacturing systems are among the technologies that can provide …

In this work, we approach the issue of privacy in distributed constraint reasoning by studying
how agents compromise solution quality for preserving privacy, using utility and game …

Much of the Distributed Constraint Satisfaction Problem (DisCSP) solving research has
addressed cooperating agents, and privacy was frequently mentioned as a significant …

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 …

Résumé La privacité a toujours été une motivation majeure pour la résolution de problèmes
distribués, et particulièrement dans les CSP distribués (DisCSP). Cependant, même si …

When approaching DCOPs with multiple variables per agent it is common practice to first
decompose each agent into several virtual agents, each holding a single variable, and then …

Privacy has been a major concern for agents in distributed constraint reasoning. In this work,
we approach this issue in distributed constraint reasoning by letting agents compromise …

The underfill phenomenon is driven by many dynamic interactions which can be studied
from a fundamental standpoint. Although capillary action generally drives the filling …

Real life problems can be solved by a distributed way, in particular by multi-agent
approaches. However, the fault tolerance is not guarantee when an agent, for example …