University of Birmingham > Talks@bham > Theoretical computer science seminar > Composable Constraint Models for Permutation Problems

Composable Constraint Models for Permutation Problems

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

If you have a question about this talk, please contact George Kaye.

We will explore different permutation patterns, properties and statistics.

While giving you the many definitions I will show how they translate into different constraint models. Finally (and of most interest), I will show how we can very easily mix&match all the models into useful tools to solve problems for mathematicians (statisticians) or computational biologists.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.