Artificial Intelligence - Lecture 8: Constraint Satisfaction Problems
Số trang: 22
Loại file: pdf
Dung lượng: 631.91 KB
Lượt xem: 15
Lượt tải: 0
Xem trước 3 trang đầu tiên của tài liệu này:
Thông tin tài liệu:
Backtracking = depth-first search with one variable assigned per node; variable ordering and value selection heuristics help significantly; forward checking prevents assignments that guarantee later failure; constraint propagation (e.g., arc consistency) does additional work to constrain values and detect inconsistencies; the CSPs representation allows analysis of problem structure.
Nội dung trích xuất từ tài liệu:
Artificial Intelligence - Lecture 8: Constraint Satisfaction Problems
Nội dung trích xuất từ tài liệu:
Artificial Intelligence - Lecture 8: Constraint Satisfaction Problems
Tìm kiếm theo từ khóa liên quan:
Artificial Intelligence Artificial Intelligence Constraint Satisfaction Problems Backtracking search Problem structure Local search for CSPsTài liệu liên quan:
-
Ebook Managing risk and information security: Protect to enable - Part 2
102 trang 279 0 0 -
VinaGPT-2: Generative pretrained transformer for Vietnamese
9 trang 111 0 0 -
Ebook Ethical and social issues in the information age (Fifth edition): Part 2
208 trang 68 0 0 -
Ebook Disrupting finance: FinTech and strategy in the 21st century
194 trang 53 0 0 -
Ebook Automation in Garment Manufacturing - part 1
211 trang 45 0 0 -
Lecture note Artificial Intelligence - Chapter 3: Problem solving and search
13 trang 43 0 0 -
Building credit scoring process in Vietnamese commercial banks using machine learning
14 trang 40 0 0 -
Utilizing google translate and imtranslator as intelligent artificial tools in EFL classes
12 trang 39 0 0 -
Ebook Artificial intelligence: Part 2 - Parminder Kaur
119 trang 37 0 0 -
Lecture note Artificial Intelligence - Chapter 5: Constraint Satisfaction Problems
7 trang 36 0 0