A novel processor for dynamic evolution of constrained SAT problems: The dynamic evolution variant of the discrete Hopfield neural network satisfiability model
The Boolean satisfiability problem, a renowned NP-complete challenge in computer science, has recently garnered interest in the Discrete Hopfield Neural Network - Satisfiability model. This model adeptly integrates logical rules into Hopfield networks, excelling in locating global minima for traditi...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Springer
2024-01-01
|
| Серии: | Journal of King Saud University: Computer and Information Sciences |
| Предметы: | |
| Online-ссылка: | http://www.sciencedirect.com/science/article/pii/S1319157824000168 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|