Applying interchangeability techniques to the distributed breakout algorithm

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 1381-1382

  Petcu, Adrian ^a   Faltings, Boi ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED SENSOR NETWORKS; NUMBER OF CYCLES; TEST PROBLEM; TIME REQUIREMENTS;

ALGORITHMS; SENSOR NETWORKS;

PROBLEM SOLVING;

EID: 84880768145     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Eugene C. Freuder 'Eliminating interchangeable values in CSPs' In Proc. of AAAI 1991
2. Weixiong Zhang and Lars Wittenburg Distributed Breakout Revisited. In Proc. of AAAI 2002
3. Carla Gomes, Cesar Fernandez, Ramon Bcjar Communication and Computation in DisCSP Algorithms. In Proc. of CP-2002, Ithaca, New York, USA
4. Berthe Choueiry and G. Noubir: On the Computation of Local lnterchangeability in Discrete Constraint Satisfaction Problems. In Proc. of AAAI-98.
5. Morris, P. The breakout method for escaping from local minima. In Proceedings of the Eleventh National Conference on Artificial Intelligence, 40-45
6. Makoto Yokoo The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Trans, on Knowledge and Data Engineering