Note: Some minor changes took place on the schedule since the first time it was posted on the web
| Sunday - September 8 | |
|---|---|
| Workshops / Symposium | |
| Monday - September 9 | |
| 9.00 - 9.15 | Welcome |
| 9.15 - 10.15 | Invited Talk Perceptron and SVM Revisited: Large Scale Applications to Bioinformatics Jean-Louis Lassez |
| 10.15 - 10.30 | Break |
| 10.30 - 13.00 | Technical Session: Symmetries |
| - |
Groupe and Constraints: Symmetry Breaking During Search I.P. Gent, W. Harvey and T. Kelsey |
| - |
Partial Symmetry Breaking Iain McDonald and Barbara Smith |
| - |
Symmetry Breaking Revisited Jean-Francois Puget |
| - |
Breaking Row and Column Symmetries in Matrix Models
Pierre Flener, Alan M Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Justin Pearson and Toby Walsh |
| - |
Solving the Kirkman's Schoolgirl Problem in a
few seconds Nicolas Barnier and Pascal Brisset |
| 13.00 - 14.00 | Lunch |
| 14.00 - 15.30 | Tutorial Finite-Domain Constraint Programming Systems Mats Carlsson and Christian Schulte |
| 15.30 - 15.45 | Break |
| 15.45 - 17.00 | Technical Session: Programming & Modeling |
| - |
A Dual Graph Translation of a Problem in `Life' Barbara M. Smith |
| - |
Inferring Constraint Types in Constraint Programming David Lesaint |
| - |
Model-based Programming: Controlling Embedded Systems
by Reasoning about Hidden State Brian C. Williams and Michael D. Ingham |
| 15.45 - 17.00 | Doctoral Tutorial Ethical Constraints Toby Walsh |
| Evening | Social Event |
| Tuesday - September 10 | |
| 9.00 - 10.00 | Invited Talk A Polyhedral Approach to Nonconvex Optimization G. Nemhauser |
| 10.00 - 11.15 | Technical Session: Innovative Applications I | - |
Visopt ShopFloor:
On the edge of planning and scheduling Roman Bartak |
| - |
Constraint Programming Contribution to Benders Decomposition:
A Case Study T. Benoist, E. Gaudin and B. Rottembourg |
| - |
Modeling Camera Control with Constrained Hypertubes Marc Christie, Eric Languénou and Laurent Granvilliers |
| 11.15 - 11.30 | Break |
| 11.30 - 13.00 | Technical Session: Innovative Applications II |
| - |
Robust and Parallel Solving of a Network Design Problem Claude Le Pape, Laurent Perron, Jean Charles Regin and Paul Shaw |
| - |
Connections Reservation with Rerouting for ATM Networks:
A Hybrid Approach with Constraints Muriel Lauvergne, Philippe David and Patrice Boizumault |
| - |
Communication and Computation in DCSP Algorithms Cèsar Fernàndez, Ramón Béjar, Bhaskar Krishnamachari and Carla Gomes |
| 11.30 - 13.00 | Doctoral Program Session (I) |
| 13.00 - 14.00 | Lunch |
| 14.00 - 15.00 | Invited Talk Constraints and Probabilistic networks: a look at the interface Rina Dechter |
| 15.00 - 15.15 | Break |
| 15.15 - 15.45 | Computational Symposium Report Michael Trick |
| 15.45 - 17.00 | Technical Papers: Soft Constraints |
| - |
Learning and Solving Soft Temporal Constraints:
An Experimental Study F. Rossi, A. Sperduti, K.B. Venable, L. Khatib, P. Morris and R. Morris |
| - |
Opportunistic Specialization in Russian Doll Search Pedro Meseguer, Marti Sanchez and Gerard Verfaillie |
| - |
Range-Based Algorithm for Max-CSP Thierry Petit, Jean-Charles Regin and Christian Bessiere |
| Evening: | Doctoral Program Dinner |
| Wednesday - September 11 | |
| 9.00 - 10.00 | Invited Talk Bounded Model Checking and the Diameter Problem Edmund Clarke |
| 10.00 - 11.15 | Technical Session: SAT I |
| - |
Accelerating Random Walks Wei Wei and Bart Selman |
| - |
A Hybrid Approach for SAT Djamal Habet, Chu Min Li, Laure Devendeville and Michel Vasquez |
| - |
Recovering and exploiting structural knowledge from CNF Richard Ostrowski, Eric Grégoire, Bertrand Mazure and Lakhdar Saïs |
| 11.15 - 11.30 | Break |
| 11.30 - 13.00 | Technical Session: SAT II |
| - |
Towards a symmetric treatment of satisfaction and conflicts
in Quantified Boolean Formula Evaluation Lintao Zhang and Sharad Malik |
| - |
Determining the Number of Solutions to Binary CSP Instances Ola Angelsmark, Peter Jonsson, Svante Linusson and Johan Thapper |
| - |
Scaling and Probabilistic Smoothing:
Efficient Dynamic Local Search for SAT Frank Hutter, Dave A.D. Tompkins and Holger H Hoos |
| 11.30 - 13.00 | Doctoral Program Session (II) |
| 13.00 - 14.00 | Lunch |
| 14.00 - 15.30 | Tutorial Constraint and Integer Programming John Hooker |
| 15.30 - 15.45 | Break |
| 15.45 - 17.00 | Technical Session: Complexity |
| - |
Resolution Complexity of Random Constraints David G. Mitchell |
| - |
Constraint Satisfaction, Bounded Treewidth,
and Finite-Variable Logics Victor Dalmau, Phokion G. Kolaitis and Moshe Y. Vardi |
| - |
Restart Policies that Consider Dependence Among Runs:
A Dynamic Programming Approach Yongshao Ruan, Eric Horvitz and Henry Kautz |
| 15.45 - 17.00 | Conference Posters |
| Evening: | Banquet |
| Thursday - September 12 | |
| 9.00 - 10.00 | Invited Talk Randomization and linear programming in the design (and analysis) of heuristics for discrete optimization problems D. Shmoys |
| 10.00 - 11.15 | Technical Session: Hybrid Approaches I |
| - |
Reduced cost-based ranking for
generating promising subproblems M. Milano and W.J. van Hoeve |
| - |
Integrating Constraint and Integer Programming for
the Orthogonal Latin Squares Problem G.Appa, I.Mourtos and D.Magos |
| - |
On Optimal Correction of Inconsistent
Linear Constraints Paula Amaral and Pedro Barahona |
| 11.15 - 11.30 | Break |
| 11.30 - 13.00 | Technical Session: Hybrid Approaches II |
| - |
Consistency Checking for Qualitative Spatial Reasoning
with Cardinal Directions Spiros Skiadopoulos and Manolis Koubarakis |
| - |
Temporal Planning through Mixed Integer Programming Yannis Dimopoulos and Alfonso Gerevini |
| - |
A Global filtering algorithm for handling systems
of Quadratic Equations and Inequations Yahia Lebbah, Michel Rueher and Claude Michel |
| 11.30 - 13.00 | Doctoral Program Session (III) |
| 13.00 - 14.00 | Lunch |
| 14.00 - 15.30 | Tutorial Global Constraints Nicolas Beldiceanu and Jean-Charles Regin |
| 15.30 - 15.45 | Break |
| 15.45 - 17.00 | Technical Session: Global Constraints |
| - |
A New Multi-Resource cumulatives Constraint with
Negative Heights Nicolas Beldiceanu and Mats Carlsson |
| - |
On the Sum Constraint: Relaxation and Applications Tallys H. Yunes |
| - |
Global constraints for lexicographic orderings Alan Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel and Toby Walsh |
| - | PC Dinner |
| Friday - September 13 | |
| 9.00 - 10.30 | Tutorial Interval Reasoning Frederic Benhamou |
| 10.30 - 10.45 | Break |
| 10.45 - 12.00 | Technical Session: CSP |
| - |
Secure Distributed Constraint Satisfaction:
Reaching Agreement without Revealing Private Information Makoto Yokoo, Koutarou Suzuki, Katsutoshi Hirayama |
| - |
Open Constraint Satisfaction Boi Faltings and Santiago Macho-Gonzalez |
| - |
Beyond NP: Arc-consistency for quantified
constraints Lucas Bordeaux and Eric Monfroy |
| 12.00 - 13.00 | Doctoral Tutorial To Advise and To Be Advised Manuela Veloso |
| 13.00 - 14.00 | Lunch |
| 14.00 - 14.15 |
Presentation of CP'03 and CP'AI'OR'03 Francesca Rossi and Gille Pesant |
| 14.15 - 15.30 | Technical Session: Learning |
| - |
ACE, The Adaptive Constraint Engine Susan L. Epstein, Eugene C. Freuder, Richard Wallace, Anton Morozov and Bruce Samuels |
| - |
Indexical-based Solver Learning Thi Bich Hanh Dao, Arnaud Lallouet, Andrei Legtchenko and Lionel Martin |
| - |
Learning the Empirical Hardness of Optimization
Problems: The case of combinatorial auctions Kevin Leyton-Brown, Eugene Nudelman and Yoav Shoham |
| 15.30 - 15.45 | Break |
| 15.45 - 17.00 | Technical Session: Scheduling |
| - |
Amplification of Search Performance Through Randomization
of Heuristics Vincent A. Cicirello and Stephen F. Smith |
| - |
Computing the Envelope for Stepwise Constant Resource Allocations Nicola Muscettola |
| - |
Local Probing Applied to Scheduling Olli Kamarainen and Hani El Sakkout |