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) -
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) -
Xerosis: from pathogenesis to solving practical problems
by: Irina E. Torshina
Published: (2024-12-01) -
Visualization of solving problems with sequences of numbers: Statistical comparison of the two methods
by: Mihajlov-Carević Miroslava, et al.
Published: (2021-01-01) -
One‐step backtracking for occlusion detection in real‐time visual tracking
by: Yulong Xu, et al.
Published: (2017-03-01)