Results 131 to 140 of about 18,622 (181)
A Novel Traffic Scheduling Algorithm for Multi-CQF Using Mixed Integer Programming and Variable Neighborhood Search Genetic Algorithm in Time-Sensitive Networking. [PDF]
Sensors (Basel)Wang C, Lin Z, Zhao Y, Hu F, Huan Z.
europepmc +1 more source
A novel obfuscation method based on majority logic for preventing unauthorized access to binary deep neural networks. [PDF]
Sci RepMohseni A, Moaiyeri MH, Adel MJ.
europepmc +1 more source
Sampling with flows, diffusion, and autoregressive neural networks from a spin-glass perspective. [PDF]
Proc Natl Acad Sci U S AGhio D +3 more
europepmc +1 more source
Producing Proofs of Unsatisfiability with Distributed Clause-Sharing SAT Solvers. [PDF]
J Autom ReasonMichaelson D +4 more
europepmc +1 more source
Algorithms for the maximum satisfiability problem
Computing (Vienna/New York), 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pierre Hansen, Brigitte Jaumard
exaly +4 more sources
Probabilistic bounds and algorithms for the maximum satisfiability problem
Annals of Operations Research, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Endre Boros
exaly +3 more sources
2014 International Conference on Machine Learning and Cybernetics, 2014 The satisfiability problem is the first problem proved to be NP-Complete and has been one of the core NP-Complete problems since then. The satisfiability problem is a decision problem. And the maximum satisfiability problem is its optimization version that aims to find an assignment that satisfies most clauses.
Lin-Yu Tseng
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Refined Branching Algorithm for the Maximum Satisfiability Problem
Algorithmica, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wenjun Li, Yongjie Yang, Jianer Chen
exaly +3 more sources