When is it worthwhile to propagate a constraint? A probabilistic analysis of A<scp>ll</scp>D<scp>ifferent</scp>

DOI10.1137/1.9781611973037.10zbMath1430.68290OpenAlexW4361851926MaRDI QIDQ5194741

Jérémie du Boisberranger, Charlotte Truchet, Xavier Lorca, Daniéle Gardy

Publication date: 17 September 2019

Published in: 2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973037.10

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

How efficient is a global constraint in practice? A fair experimental framework

This page was built for publication: When is it worthwhile to propagate a constraint? A probabilistic analysis of A<scp>ll</scp>D<scp>ifferent</scp>