<  Back to the Polytechnique Montréal portal

Items where Author is "Zanarini, Alessandro"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Jump to: L | P | Z
Number of items: 8.

L

Le Bras, R., Zanarini, A., & Pesant, G. (2009, September). Efficient generic search heuristics within the embp framework [Paper]. 15th International Conference on Principles and Practice of Constraint Programming (CP 2009), Lisbon, Portugal. External link

P

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. External link

Pesant, G., & Zanarini, A. (2011, May). Recovering indirect solution densities for counting-based branching heuristics [Paper]. 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011), Berlin, Germany. External link

Z

Zanarini, A. (2010). Exploiting Global Constraints for Search and Propagation [Ph.D. thesis, École Polytechnique de Montréal]. Available

Zanarini, A., & Pesant, G. (2009). Solution counting algorithms for constraint-centered search heuristics. Constraints, 14(3), 392-413. External link

Zanarini, A., & Pesant, G. (2007). Solution counting algorithms for constraint-centered search heuristics. (Working Paper n° CIRRELT-2007-18). External link

Zanarini, A., & Pesant, G. (2007, May). Generalizations of the global cardinality constraint for hierarchical resources [Paper]. 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2007), Brussels, Belgium. External link

Zanarini, A., & Pesant, G. (2007, September). Solution counting algorithms for constraint-centered search heuristics [Paper]. 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), Providence, RI, United States. External link

List generated on: Thu Jan 16 05:47:45 2025 EST