Interpretable decision trees through MaxSAT. [PDF]
Artif Intell Rev, 2022 Alòs J, Ansótegui C, Torres E.
europepmc +1 more source
Further observations on the security of Speck32-like ciphers using machine learning. [PDF]
PeerJ Comput SciHou Z, Ren J, Chen S.
europepmc +1 more source
Quantum Computing for Transport Network Optimization. [PDF]
Entropy (Basel)Ju J +7 more
europepmc +1 more source
Golem: a flexible and efficient solver for constrained Horn clauses. [PDF]
Form Methods Syst DesBlicha M, Britikov K, Sharygina N.
europepmc +1 more source
Quadratic unconstrained binary optimization and constraint programming approaches for lattice-based cyclic peptide docking. [PDF]
Sci RepBrubaker JK +6 more
europepmc +1 more source
Streamlining Distributed SAT Solver Design
Distributed clause-sharing SAT solvers have recently been established as powerful automated reasoning tools that can conquer previously infeasible instances. A common design of distributed SAT solvers is to run many off-the-shelf sequential solvers in parallel, employ some diversification (e.g., restart intervals or decision orders), and share conflict
Schreiber, Dominik +2 more
openaire +1 more source
Intersubject variability in a comprehensive numerical assessment of operator electromagnetic exposure to TMS. [PDF]
Front Public HealthD'Agostino S +4 more
europepmc +1 more source
Logic-based Approach and Visualization for the Nuclear Medicine Rescheduling Problem. [PDF]
J Med SystMarte C +4 more
europepmc +1 more source
Multiparametric robust sensing via readout of characteristic magnetization loops. [PDF]
Sci RepPath MP, Vogel M, McCord J.
europepmc +1 more source
3SAT on an all-to-all-connected CMOS Ising solver chip. [PDF]
Sci RepCılasun H +9 more
europepmc +1 more source