Results 131 to 140 of about 1,567 (182)
Solving perfect matchings by frequency-grouped multi-photon events using a silicon chip. [PDF]
Nat CommunZhu P +8 more
europepmc +1 more source
Parameterized Complexities of Dominating and Independent Set Reconfiguration
, 2022 Bodlaender HL +2 more
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
Network topology and interaction logic determine states it supports. [PDF]
NPJ Syst Biol ApplGedeon T.
europepmc +1 more source
A Process Algebraic Approach to Predict and Control Uncertainty in Smart IoT Systems for Smart Cities Based on Permissible Probabilistic Equivalence. [PDF]
Sensors (Basel)Song J, Karagiannis D, Lee M.
europepmc +1 more source
A dataset on vulnerabilities affecting dependencies in software package managers. [PDF]
Data BriefMárquez AG +2 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Sums of Squares, Satisfiability and Maximum Satisfiability
2005Recently the Mathematical Programming community showed a renewed interest in Hilbert's Positivstellensatz. The reason for this is that global optimization of polynomials in ℝ[x1,...,xn] is $\mathcal{NP}$-hard, while the question whether a polynomial can be written as a sum of squares has tractable aspects.
Hans van Maaren, Linda van Norden
openaire +1 more source
2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies a number of desired output (label/response) constraints. LSAT problems naturally arise in many applications in which one is interested in the class of inputs that produce ...
Frederic Thouin +4 more
openaire +1 more source
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies a number of desired output (label/response) constraints. LSAT problems naturally arise in many applications in which one is interested in the class of inputs that produce ...
Frederic Thouin +4 more
openaire +1 more source
Approximating Satisfiable Satisfiability Problems
Algorithmica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources