Doctoral Program

As part of the 2011 International Conference on Principles and Practice of Constraint Programming, we invited PhD students to apply for the Doctoral Program. This program provided an opportunity for current PhD students to meet each other as well as researchers in the field. Participants presented their work via both a poster and a talk.

Participation in the Doctoral Program involved:

• Presentation of talks during the Doctoral Program session on Monday, Sept. 12.
• Presentation of posters.
• Discussions with a mentor with similar research interests.
• Entry to the CP 2011 conference.

Program and Proceedings

The doctoral program proceedings PDF as well as Laurent Michel's tutorial slides are available for download.

Program

September 12th, Monday

Time
08:45	Welcome + Opening
08:50	Anna Roubickova: Flexible timeline-based planning and its constraints
09:10	Dario Campagna: A CLP-based System For Custom Product Manufacturing
09:30	Hu Xu: Genetic Based Automatic Congurator for Minion
09:50	Nicholas Downing: Explaining flow-based propagation
10:10	Maria Francisco: Consistency of Constraint Networks Induced by Automaton-Based Constraint Specifications
10:30	Coffee Break
10:55	Arnaud Letort: Cumulatives trajectories: a Constraint for Modelling Preemptive Reassignable Tasks with Momenterily Resource Consumption
11:15	Joseph Scott: A Quadratic Edge-Finding Filtering Algorithm for Cumulative Resource Constraints
11:35	Katherine Lai: The Min Average Latency Steiner Multigraph Problem: Budget-Constrained Wildlife Corridor Design for Multiple Species
11:55	Florence Massen: A Relaxation-Guided Approach for Vehicle Routing Problems with Black Box Feasibility
12:15	Faten Nabli: Finding minimal siphons and traps as a Constraint satisfaction Problem
12:35	Lunch Break
14:20	Matthew Gwynne: Towards a better understanding of hardness
14:40	Markus Aschinger: A new logic-based formalism for Configuration problems
15:00	Silvia Tomasi: Satisfiability Modulo Theory with Cost Optimization
15:20	Walid Trabelsi: Pruning Rules for Constrained Optimisation for Conditional Preferences
15:40	Coffee Break
16:10	Guillaume Escamocher: Mapping Out the Tractability of 3-Variable Forbidden Patterns
16:30	Natalia Flerova: Bucket and Mini-bucket Schemes for M Best Solutions over Graphical Models
16:50	Jean-Baptiste Mairy: Reinforced Adaptive Large Neighborhood Search
17:10	Eoin O'Mahony: Incorporating Variance in Impact-Based Search
17:30	Dario Pacino: Adaptive Randomized Decompositions for Jobshop Scheduling
18:00	Guided tour of the city
20:00	CP welcome reception

September 13th, Tuesday

Time
19:30	Doctoral program dinner at "Mi' Cocco"

September 14th, Wednesday

Time
12:35	Lunch break	Poster session: Markus Aschinger, Alessio Bonfietti, Dario Campagna, Jessica Davies, Alexis De Clercq, Nicholas Downing, Samir Elsayed, Guillaume Escamocher, Jean-Guillaume Fages, Natalia Flerova, Maria Francisco, Matthew Gwynne, Antti Hyvärinen, Katherine Lai, Ronan Le Bras

September 15th, Thursday

Time
12:35	Lunch break	Poster session: Vianney le Clément, Arnaud Letort, Jean-Baptiste Mairy, Florence Massen, Amit Metodi, Faten Nabli, Eoin O'Mahony, Dario Pacino, Marie Pelleau, Justyna Petke, Anna Roubickova, Joseph Scott, Silvia Tomasi, Walid Trabelsi, Hu Xu
14:00	Doctoral Tutorial [Aula 8] Laurent Michel: Mastering the Empirical Maze This tutorial will explore the issues revolving around the design and execution of experiments and the presentation of the results. These seemingly simple tasks are rife with pitfalls and fallacies that are too often the downfall of a good piece of work. The advent of modern architecture and the increasing reliance on randomization further muddles the issue and place a significant burden on anyone attempting to reproduce poorly designed and presented results. The purpose of the tutorial is to provide a roadmap to navigate this subtle maze and deliver convincing empirical evidence in your future papers!