Title:	Modeling and solving adversary problems with QCSP
Date:	May 15, 2009 (Friday)
Time:	2:30 p.m. - 3:30 p.m.
Venue:	Room 121, 1/F, Ho Sin-hang Engineering Building, The Chinese University of Hong Kong, Shatin, N.T.
Speaker:	Prof. Arnaud Lallouet Professor Department of Computer Science University of Caen France

ABSTRACT:

Constraint Satisfaction Problems allow to model and solve efficiently many combinatorial problems like scheduling, resource allocation, configuration or timetabling, among others. Quantified Constraint Problems extend this framework with the ability of dealing with an adversary or a partially unknown environment. In this talk, we will recall the basics of Constraint modeling and solving, and present the extension to adversary problems. Then we present a way to deal with optimization in this setting which allows to model multiple level decision problems known as bi-level or multi-level programming in Operational Research.

BIOGRAPHY:

Arnaud Lallouet is professor of Computer Science in the University of Caen, France. He's doing research in Constraint Programming, a field of Artificial Intelligence. He is mostly interested in the interactions of Machine Learning and Decision, and in Decision problems with adversary. He has authored more than 50 papers.

Enquiries: Miss Temmy So at tel 2609 8444

For more information, please refer to http://www.cse.cuhk.edu.hk/seminar