COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
Constraint ProgrammingAdd to your list(s) 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 listsDepartment of History and Philosophy of Science bewise Cambridge University Mycological SocietyOther talksPA Consulting: Applications of AR/VR CANCELLED - Members' Open Forum Functionalities induced by symmetry breaking Democracy Requires Organized Collective Power Enhancers get ERKed around by chromatin remodellers during lineage commitment Christmas Quiz |