Multi-variable distributed backtracking with sessions |
| |
Authors: | René Mandiau Julien Vion Sylvain Piechowiak Pierre Monier |
| |
Affiliation: | 1. Univ. de Valenciennes (UVHC) LAMIH UMR CNRS 8201, F-59313, Valenciennes, France
|
| |
Abstract: | The Constraint Satisfaction Problem (CSP) formalism is used to represent many combinatorial decision problems instances simply and efficiently. However, many such problems cannot be solved on a single, centralized computer for various reasons (e.g., their excessive size or privacy). The Distributed CSP (DisCSP) extends the CSP model to allow such combinatorial decision problems to be modelled and handled. In this paper, we propose a complete DisCSP-solving algorithm, called Distributed Backtracking with Sessions (DBS), which can solve DisCSP so that each agent encapsulates a whole “complex” problem with many variables and constraints. We prove that the algorithm is sound and complete, and generates promising experimental results. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|