Applying aspiration in local search for satisfiability

The Boolean Satisfiability problem (SAT) is a prototypical NP-complete problem, which has been widely studied due to its significant importance in both theory and applications. Stochastic local search (SLS) algorithms are among the most efficient approximate methods available for solving certain typ...

Descripción completa

Detalles Bibliográficos
Autores principales: Peng, Cong, Xu, Zhongwei, Mei, Meng
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2020
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7179859/
https://www.ncbi.nlm.nih.gov/pubmed/32324765
http://dx.doi.org/10.1371/journal.pone.0231702

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7179859/
https://www.ncbi.nlm.nih.gov/pubmed/32324765
http://dx.doi.org/10.1371/journal.pone.0231702

Ejemplares similares