Cargando…
A Variable Neighborhood Walksat-Based Algorithm for MAX-SAT Problems
The simplicity of the maximum satisfiability problem (MAX-SAT) combined with its applicability in many areas of artificial intelligence and computing science made it one of the fundamental optimization problems. This NP-complete problem refers to the task of finding a variable assignment that satisf...
Autor principal: | Bouhmala, Noureddine |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4142167/ https://www.ncbi.nlm.nih.gov/pubmed/25177732 http://dx.doi.org/10.1155/2014/798323 |
Ejemplares similares
-
MaxSAT Resolution and Subcube Sums
por: Filmus, Yuval, et al.
Publicado: (2020) -
Incomplete MaxSAT approaches for combinatorial testing
por: Ansótegui, Carlos, et al.
Publicado: (2022) -
Interpretable decision trees through MaxSAT
por: Alòs, Josep, et al.
Publicado: (2022) -
Initial Solution Generation and Diversified Variable Picking in Local Search for (Weighted) Partial MaxSAT
por: Zhang, Zaijun, et al.
Publicado: (2022) -
Application of Max-SAT-based ATPG to optimal cancer therapy design
por: Lin, Pey-Chang Kent, et al.
Publicado: (2012)