Abstract
An important class of CSP heuristics work by sampling information during search in order to inform subsequent decisions. An example is the use of failures, in the form of constraint weights, to guide variable selection in a weighted degree procedure. The present research analyses the characteristics of the sampling process in this procedure and the manner in which information is used, in order to better understand this type of strategy and to discover further enhancements.
This work was supported by Science Foundation Ireland under Grants 00/PI.1/C075 and 05/IN/1886.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proc. Sixteenth European Conference on Artificial Intelligence-ECAI 2004, pp. 146–150 (2004)
Grimes, D., Wallace, R.J.: Learning from failure in constraint satisfaction search. In: Ruml, W., Hutter, F. (eds.) Learning for Search: Papers from the 2006 AAAI Workshop, pp. 24–31. Tech. Rep. WS-06-11 (2006)
Grimes, D., Wallace, R.J.: Learning to identify global bottlenecks in constraint satisfaction search. In: 20th International FLAIRS Conference (2007)
Eisenberg, C., Faltings, B.: Using the breakout algorithm to identify hard and unsolvable subproblems. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 822–826. Springer, Heidelberg (2003)
Beck, J.C., Prosser, P., Wallace, R.J.: Trying again to fail-first. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS (LNAI), vol. 3419, pp. 41–55. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grimes, D., Wallace, R.J. (2007). Sampling Strategies and Variable Selection in Weighted Degree Heuristics. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_61
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)