From Backtracking To Deep Learning: A Survey On Methods For Solving Constraint Satisfaction Problems
Constraint Satisfaction Problems (CSP) are a fundamental mechanism in artificial intelligence, but finding a solution is an NP-complete problem, requiring the exploration of a vast number of combinations to satisfy all constraints. To address this, extensive research has been conducted, leading to...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Technology and Education Galileo da Amazônia
2025-01-01
|
| Series: | ITEGAM-JETIA |
| Online Access: | http://itegam-jetia.org/journal/index.php/jetia/article/view/1449 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|