COMPSCI 188 - 2018-09-06 - Constraint Satisfaction Problems (CSPs) Part 2/2
Professor of Electrical Engineering and Computer Sciences
1:25:00·2018·undergraduate level
This lecture extends the analysis of Constraint Satisfaction Problems (CSPs), detailing k-consistency, algorithms for tree-structured CSPs, and the application of cutset conditioning. It also introduces local search methods such as hill climbing for solving CSPs.
Theory & AlgosAlgorithms & Data StructuresConstraint SatisfactionBacktracking SearchTree Decomposition
COMPSCI 188, LEC 001 - Fall 2018
COMPSCI 188, LEC 001 - Pieter Abbeel, Daniel Klein
Copyright @2018 UC Regents; all rights reserved
Previous · Lecture 4
COMPSCI 188 - 2018-09-04 - Constraint Satisfaction Problems (CSPs) Part 1/2
Next · Lecture 6COMPSCI 188 - 2018-09-11 - Search with Other Agents: Minimax
Comments
Add a comment...Sign in