Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Seongsoo Moon"'
Autor:
Seongsoo Moon, Mary Inaba
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 8:56-63
Most state-of-the-art satisfiability (SAT) solvers are capable of solving large application instances with efficient branching heuristics. The VSIDS heuristic is widely used because of its robustness. This paper focuses on the inherent ties in VSIDS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b60e2daec58398517dc177a9a27b5d59
https://doi.org/10.1609/socs.v8i1.18422
https://doi.org/10.1609/socs.v8i1.18422
Autor:
Mary Inaba, Seongsoo Moon
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319503486
LION
LION
Diversification plays an important role in portfolio-based parallel SAT solvers. To maintain diversity, state-of-the-art solvers allocate different search policies and share learned clauses. However, the possibility of similarities between search spa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02e8edffa82fe2cf35187f29f69eb91e
https://doi.org/10.1007/978-3-319-50349-3_21
https://doi.org/10.1007/978-3-319-50349-3_21
