University of Cambridge > Talks.cam > Churchill CompSci Talks > Constraint Programming

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Constraint Programming

Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland .

From solving our morning Sudoku puzzle to finding cheap flights (for a post-COVID holiday), we as humans encounter many problems where we need to find feasible solutions from a large search space. How do we go about this? How do we ensure that we find a viable solution in a reasonable time period?

In this talk, I will cover constraint programming; a paradigm that helps us solve such problems. We will first discuss approaches to solve CSPs(Constraint Satisfaction Problems) such as backtracking and local search, and then take a look at some optimisations we can make to reduce our search space.

This talk is part of the Churchill CompSci Talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Oldham Hall Seminar Room, Lucy Cavendish College Mary Allan Building, Homerton College, Hills Road, Cambridge CB2 8PQ Small Lecture Theatre (VENUE CHANGE), Cavendish Laboratory

Other talks

Am I a Member? Auditing Private Machine Learning LMB Seminar - Mechanisms of mRNA packaging and export Group Work "Gods, Monsters & Middle-class Uncles: Indian Comics in a Time between Worlds" Title to be confirmed Organiser Welcome
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity