![]() |
![]() |
University of Birmingham > Talks@bham > Theoretical computer science seminar > Composable Constraint Models for Permutation Problems
Composable Constraint Models for Permutation ProblemsAdd 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. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsRSLC PhD/Postdoc Seminars (Chemistry) Beverley Glover Applied Mathematics Seminar SeriesOther talksThe tragic destiny of Mileva Marić Einstein Quantum Sensing in Space TBA TBA Life : it’s out there, but what and why ? Waveform modelling and the importance of multipole asymmetry in Gravitational Wave astronomy |