共 50 条
- [42] Learning Nobetter Clauses in Max-SAT Branch and Bound Solvers 2016 IEEE 28TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2016), 2016, : 452 - 459
- [43] A Stochastic Local Search Algorithm for the Partial Max-SAT Problem Based on Adaptive Tuning and Variable Depth Neighborhood Search IEEE ACCESS, 2021, 9 (09): : 49806 - 49843
- [44] On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2010, PROCEEDINGS, 2010, 6175 : 223 - +
- [45] Scaling and probabilistic smoothing: Dynamic local search for unweighted MAX-SAT ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2003, 2671 : 145 - 159
- [47] Learning MAX-SAT from Contextual Examples for Combinatorial Optimisation THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 4493 - 4500
- [48] Three Truth Values for the SAT and MAX-SAT Problems 19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 187 - 192
- [49] Search space features underlying the performance of stochastic local search algorithms for MAX-SAT PARALLEL PROBLEM SOLVING FROM NATURE - PPSN VIII, 2004, 3242 : 51 - 60
- [50] Discrete Lagrangian-based search for solving MAX-SAT problems IJCAI-97 - PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 1997, : 378 - 383