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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Grimes, D., & Wallace, R. J. (2007). Sampling strategies and variable selection in weighted degree heuristics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4741 LNCS, pp. 831–838). Springer Verlag. https://doi.org/10.1007/978-3-540-74970-7_61
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
