1 code implementation • 29 Nov 2022 • Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-min Li, Felip Manyà
In this paper, we propose a local search algorithm for these problems, called BandHS, which applies two multi-armed bandits to guide the search directions when escaping local optima.
no code implementations • 26 May 2021 • Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia, Eduard Torres
We present a Satisfiability (SAT)-based approach for building Mixed Covering Arrays with Constraints of minimum length, referred to as the Covering Array Number problem.
no code implementations • 29 Jul 2018 • Chu-min Li, Fan Xiao, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li
Original and learnt clauses in Conflict-Driven Clause Learning (CDCL) SAT solvers often contain redundant literals.