ECAI 2006 Workshop on Distributed Constraint Satisfaction
Provisional Schedule as of August 14th, 2006


8:45-9:00     -----  Welcome/Introduction  -----

9:00-9:30    Descending Requirements Search for DisCSPs
       Michael Orlov, Amnon Meisels

9:30-10:00    MB-DPOP: A Memory-Bounded Extension of DPOP
       Adrian Petcu, Boi Faltings

10:00-10:30     -----  Coffee Break  -----

10:30-11:00    Asynchronous Backtracking for Non-binary DisCSP
       Ismel Brito, Pedro Meseguer

11:00-11:30    DFS ordering in Nogood-based Asynchronous Distributed Optimization (ADOPT-ng)
       Marius C. Silaghi, Makoto Yokoo

11:30-12:30    Panel: Applications and Benchmarks for the emerging technology of DisCSP

12:30-14:00      -----   Lunch Break  -----


14:00-14:30    A Comparison of Approaches to Handling Complex Local Problems in DCOP
       David Burke, Ken Brown

14:30-15:00    Solving Generalized Open Constraint Optimization Problem using Two-Level Multi-agent Framework - Improved Results
       Hoong Chuin Lau, Bang Viet Nguyen

15:00-15:30    PC-DPOP: A Partial Centralization Extension of DPOP
       Adrian Petcu, Boi Faltings

15:30-16:00     -----  Coffee Break  -----

16:00-16:30    Generic run-time measurement for DisCSP search algorithms
       Roie Zivan, Amnon Meisels

16:30-17:00    Distributed Stable Marriage with Ties and Incomplete Lists
       Ismel Brito, Pedro Meseguer

17:00-17:30    Private and Efficient Stable Marriages (Matching) - a DisCSP Benchmark
       Timothy Atkinson, Roman Bartak, Marius Silaghi, Erdal Tuleu, Markus Zanker