Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/10459.1/46634
Título:
|
An efficient solver for weighted Max-SAT
|
Autor/a:
|
Alsinet, Teresa; Manyà Serres, Felip; Planes Cid, Jordi
|
Abstract:
|
We present a new branch and bound algorithm for weighted Max-SAT, called Lazy which incorporates original data structures and inference rules, as well as a lower bound of better quality. We provide experimental evidence that our solver is very competitive and outperforms some of the best performing Max-SAT and weighted Max-SAT solvers on a wide range of instances. |
Fecha de creación:
|
2008 |
Materia(s):
|
Max-SAT WeightedMax-SAT Branch and bound Lower bound Heuristics Data structures Heurística Algorismes |
Derechos:
|
(c) Springer, (2008) |
Tipo de documento:
|
article |
Editor:
|
Springer
|
Compartir:
|
|
Documentos con el texto completo de este documento
Documentos con el texto completo de este documento
Mostrar el registro completo del ítem