Upcoming Centre Seminars/Talks
Click here to view the past Seminars/Talks.
We introduce new CP models for the many-to-many stable matching problem. We use the notion of rotation to give a novel encoding that is linear in the input size of the problem. We give extra filtering rules to maintain arc consistency in quadratic time.SpeakerName:Mohamed SialaBio:Post Doctoral ResearcherInstitution:Seminar DetailsLocation:UCCDate:11/10/2017
We propose a systematic approach for generating linear implied constraints that link the values returned by several automata with accumulators after consuming the same input sequence.SpeakerName:Helmut SimonisBio:Senior Research FellowInstitution:Seminar DetailsLocation:UCCDate:04/10/2017