 | Monter d'un niveau |
Le Bras, R., Zanarini, A., & Pesant, G. (septembre 2009). Efficient generic search heuristics within the embp framework [Communication écrite]. 15th International Conference on Principles and Practice of Constraint Programming (CP 2009), Lisbon, Portugal. Lien externe
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. Lien externe
Pesant, G., & Zanarini, A. (mai 2011). Recovering indirect solution densities for counting-based branching heuristics [Communication écrite]. 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011), Berlin, Germany. Lien externe
Zanarini, A. (2010). Exploiting Global Constraints for Search and Propagation [Thèse de doctorat, École Polytechnique de Montréal]. Disponible
Zanarini, A., & Pesant, G. (2009). Solution counting algorithms for constraint-centered search heuristics. Constraints, 14(3), 392-413. Lien externe
Zanarini, A., & Pesant, G. (2007). Solution counting algorithms for constraint-centered search heuristics. (Document de travail n° CIRRELT-2007-18). Lien externe
Zanarini, A., & Pesant, G. (mai 2007). Generalizations of the global cardinality constraint for hierarchical resources [Communication écrite]. 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2007), Brussels, Belgium. Lien externe
Zanarini, A., & Pesant, G. (septembre 2007). Solution counting algorithms for constraint-centered search heuristics [Communication écrite]. 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), Providence, RI, United States. Lien externe
