The Swedish Constraint Network, SweConsNet, is a network for Swedish-based researchers and practitioners of Constraint Programming.
Following the successful meeting in May 2002 at Uppsala University and February 2003 at SICS we would like to announce the 3rd SweConsNet workshop, which will take place at the Dept of Computer and Information Science, Linköping University, on January 15th, 2004. The purpose of this meeting is to learn about ongoing research in Constraint Programming, existing projects and products as well as to discuss further development of the network.
|10.00-11.00||Invited talk: CLP(BioNet) : Towards a CLP framework for the analysis of Biochemical Networks by Yves Deville (Louvain-la-Neuve) Abstract, slides|
|11.00-11.30||Comma Free Codes by Justin Pearson (Uppsala)|
|11.30-12.00||Declarative Concurrency for Java by Frej Drejhammar (SICS)slides|
|12.00-12.30||New Algorithms from Old by Ola Angelsmark (Linköping) slides|
|12:30-12.45||Overview of activities at SICS by Per Kreuger (SICS) slides|
|13.45-14.15||Using Constraint Programming for Embedded System Design by Radek Szymanek (Lund) slides|
|14.15-14.45||Base Station Configurations by Zhulia Ayani (LI/EAB Ericsson) slides|
|14.45-15.15||What can Constraint Programming contribute to an existing Optimisation application? by Patrik Eveborn and Jonas Fager (Optimal Solutions) slides|
|15.30-17.00||Finite Domain Constraint Programming Systems, CP'02 Invited tutorial by Mats Carlsson (SICS) and Christian Schulte (KTH) (Christian presents) slides|
For further information contact Pawel Pietrzak.
This document last modified Monday, 09-Feb-2004 12:17:59 MET