Solving non-binary constraint satisfaction problems using GHD and restart.
The non-binary instances of the Constraint Satisfaction Problem (CSP) could be efficiently solved if their constraint hypergraphs have small generalized hypertree widths. Several algorithms based on Generalized Hypertree Decomposition (GHD) have been proposed in the literature to solve instances of...
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/1415 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|