A complete algorithm for DisCSP : Distributed Backtracking with Sessions ( DBS )

@inproceedings{Monier2009ACA,
  title={A complete algorithm for DisCSP : Distributed Backtracking with Sessions ( DBS )},
  author={Pierre Monier and Sylvain Piechowiak and Ren{\'e} Mandiau},
  year={2009}
}
Many algorithms for Distributed Constraints Satisfaction Problem (DisCSP) resolution use additional links between variables not connected by constraints. This causes a higher needed memory space. In this paper, we propose an algorithm for DisCSP resolution, called Distributed Backtracking with Sessions (DBS) which does not use such additional links so that the initial problem’s topology is respected. This algorithm is complete and requires a low space complexity. The main feature of this… CONTINUE READING
6 Citations
8 References
Similar Papers

Similar Papers

Loading similar papers…