Lecture 8: Constraints: Search, Domain Reduction

Name: Lecture 8: Constraints: Search, Domain Reduction
Uploaded: 2021-04-23T20:35:50Z
Duration: 45 min 6 s
Description: Description: This lecture covers map coloring and related scheduling problems. We develop pseudocode for the domain reduction algorithm and consider how much constraint propagation is most efficient, and whether to start with the most or least constrained variables. Instructor: Patrick H. Winston

45:06

Up Next

Lecture 9: Constraints: Visual Object Recognition

Continue

Description: This lecture covers map coloring and related scheduling problems. We develop pseudocode for the domain reduction algorithm and consider how much constraint propagation is most efficient, and whether to start with the most or least constrained variables.

Instructor: Patrick H. Winston