Multi-variable distributed backtracking with sessions - Université Polytechnique des Hauts-de-France
Article Dans Une Revue Applied Intelligence Année : 2014

Multi-variable distributed backtracking with sessions

Résumé

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.
Fichier non déposé

Dates et versions

hal-03578668 , version 1 (17-02-2022)

Identifiants

Citer

René Mandiau, Julien Vion, Sylvain Piechowiak, Pierre Monier. Multi-variable distributed backtracking with sessions. Applied Intelligence, 2014, 41 (3), pp.736-758. ⟨10.1007/s10489-014-0532-2⟩. ⟨hal-03578668⟩
22 Consultations
0 Téléchargements

Altmetric

Partager

More