Cargando…

Distributed Cube and Conquer with Paracooba

Cube and conquer is currently the most effective approach to solve hard combinatorial problems in parallel. It organizes the search in two phases. First, a look-ahead solver splits the problem into many sub-problems, called cubes, which are then solved in parallel by incremental CDCL solvers. In thi...

Descripción completa

Detalles Bibliográficos
Autores principales: Heisinger, Maximilian, Fleury, Mathias, Biere, Armin
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7326533/
http://dx.doi.org/10.1007/978-3-030-51825-7_9