______________________________________________________________________
Date:  Monday 24 November 2014
Time:  11:15
Venue: Room 1311, House 1, ITC, Polacksbacken, Uppsala University
______________________________________________________________________

   Constraint Programming in Compiler Optimisation: Lessons Learned

         Peter van Beek (https://cs.uwaterloo.ca/~vanbeek/)

                   University of Waterloo, Canada

Instruction scheduling and instruction selection are two optimisation
problems that arise in compilers.  These problems are considered
intractable, and heuristic approaches are currently used in production
compilers.  In contrast, we have pursued constraint programming
approaches that are fast and optimal.  The primary goals of this
application-driven research were twofold: (i) find solutions of
significantly higher quality, and (ii) develop novel constraint
programming techniques which have general applicability to similar
optimisation problems.  In this talk, I will describe how successful
we were in achieving these goals and some of the lessons we learned
along the way.

Biographical sketch: 

I received my PhD in 1990 from the University of Waterloo and at that
time joined the faculty at the University of Alberta.  Ten years later
I returned to Waterloo.  My research interests span the field of
artificial intelligence with a focus on constraint programming,
constraint satisfaction and optimisation, applied machine learning,
probabilistic reasoning, and applications of AI.  I have co-authored
six research papers which have won awards, and I have served on the
program committees of many conferences and on the editorial boards of
several journals, including Editor-in-Chief of the journal
Constraints.  In 2008, I was named a Fellow of the Association for
Artificial Intelligence.
______________________________________________________________________

Directions: http://www.polacksbacken.uu.se/Find_us/