Introduction
The purpose of the 1st Belgian Constraint Programming Symposium (BELCP 2010) is to bring together Belgian and international researchers and practitioners in the area of Constraint Programming. The symposium consists of formal lectures on the current state-of-the-art in Constraint Programming and provides opportunity for informal contacts.
Registration
Registration is free, but compulsory. Registration closes on February 15, 2010.
Programme
| 14:00 - 15:30 | Session 1 |
| 14:00 - 14:30 | Protein folding with constraint based techniques |
| Agostino Dovier, Univ. Udine | |
| 14:30 - 15:00 | Relational constraints and their applicability to the package installability problem |
| Gustavo Gutierrez, U.C.Louvain | |
| 15:00 - 15:30 | Heuristics and learning: 2 examples from combinatorial optimization |
| Patrick De Causmaecker, K.U.Leuven | |
| 15:30 - 16:00 | Coffee break |
| 16:00 - 17:00 | Session 2 |
| 16:00 - 16:30 | A Hybrid Solver for Large Neighborhood Search Mixing Gecode and EasyLocal++ |
| Raffaele Cipriano, Univ. Udine | |
| 16:30 - 17:00 | Nogood learning for restarting parallel search |
| Guido Tack, K.U.Leuven |
Venue
The symposium takes place in room 05.001 of the Department of Computer Science,
K.U.Leuven (directions).
Room 05.001 is the first room to the left of the central stair case on the 5th floor.
