University of Cambridge > > Wednesday Seminars - Department of Computer Science and Technology  > Interactive Configuration Problems

Interactive Configuration Problems

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact David Greaves.

In this talk we will introduce interactive configuration problems. An interactive configurator is a software application that guides a user in choosing a sequence of values to form a valid configuration. Validity is defined by a constraint satisfaction problem and an interactive configurator is in essence repeatedly solving a high number of highly related NP-hard satisfaction problems. Despite the intrinsic hardness of the problem, algorithms exist that perform very well in practice being able to solve constraint problems with 10,000’s of variables. We will describe these algorithms as well as the commercial applications of them in a variety of very diverse areas such as configuration of wind turbines, insurance policies, and the Jaguar F-Type. We will also show brief demonstrations of the software.

This talk is part of the Wednesday Seminars - Department of Computer Science and Technology series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity