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: | Fatima AIT HATRIT, Kamal AMROUN |
---|---|
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!
|
Similar Items
-
Solving non-binary constraint satisfaction problems using GHD and restart.
by: Fatima AIT HATRIT, et al.
Published: (2025-01-01) -
Counting workflow satisfiability with exclusion constraints based on backtracking tree-decomposition
by: Zhinian ZHAI, et al.
Published: (2016-10-01) -
The backtrack Hölder gradient method with application to min-max and min-min problems
by: Bolte, Jérôme, et al.
Published: (2023-12-01) -
Faster backtracking algorithms for the generation of symmetry-invariant
permutations
by: Oscar Moreno, et al.
Published: (2002-01-01) -
Study on the reliability of hypergraphs based on non-backtracking matrix centrality
by: Hao PENG, et al.
Published: (2024-02-01)