Gilles Pesant
, Claude-Guy Quimper and Alessandro Zanarini
Article (2012)
An external link is available for this item
| Department: | Department of Mathematics and Industrial Engineering |
|---|---|
| PolyPublie URL: | https://publications.polymtl.ca/14815/ |
| Journal Title: | Journal of Artificial Intelligence Research (vol. 43) |
| DOI: | 10.1613/jair.3463 |
| Official URL: | https://doi.org/10.1613/jair.3463 |
| Date Deposited: | 18 Apr 2023 15:11 |
| Last Modified: | 08 Apr 2025 01:42 |
| Cite in APA 7: | Pesant, G., Quimper, C.-G., & Zanarini, A. (2012). Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems. Journal of Artificial Intelligence Research, 43, 173-210. https://doi.org/10.1613/jair.3463 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
