{'fraction_non_alphanumeric': 0.014539579967689823, 'fraction_numerical': 0.006462035541195477, 'mean_word_length': 5.458333333333333, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Breaking Symmetries in Distributed Constraint Programming Problems

Though various preprocessing techniques have been studied for improving the performance of distributed constraint satisfaction problems, no approach for detecting and breaking symmetries has been studied in depth. In this paper, we describe a method for detecting some symmetries of a given distributed problem and for exploiting them. Then, we validate it as a preprocessing method for Adopt and Dpop algorithms for some instances of the SensorDCSP problem, to find our symmetry breaker improve their performance up to 1.7 and 1.8 times respectively.