 | Up a level |
Collaboration networkThis graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Word cloudA word cloud is a visual representation of the most frequently used words in a text or a set of texts. The words appear in different sizes, with the size of each word being proportional to its frequency of occurrence in the text. The more frequently a word is used, the larger it appears in the word cloud. This technique allows for a quick visualization of the most important themes and concepts in a text.
In the context of this page, the word cloud was generated from the publications of the author {}. The words in this cloud come from the titles, abstracts, and keywords of the author's articles and research papers. By analyzing this word cloud, you can get an overview of the most recurring and significant topics and research areas in the author's work.
The word cloud is a useful tool for identifying trends and main themes in a corpus of texts, thus facilitating the understanding and analysis of content in a visual and intuitive way.
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
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
Zanarini, A. (2010). Exploiting Global Constraints for Search and Propagation [Ph.D. thesis, École Polytechnique de Montréal]. Available
Zanarini, A., & Pesant, G. (2010, June). More Robust counting-based Search Heuristics with Alldifferent Constraints [Paper]. 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010), Bologna, Italie. External link
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
Zanarini, A., Milano, M., & Pesant, G. (2006, May). Improved algorithm for the soft global cardinality constraint [Paper]. 3rd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2006), Cork, Ireland. External link
