Results 161 to 170 of about 44,520 (208)
Research on a Hybrid Scheduling Algorithm Based on Critical-Link Optimization for Large-Scale Time-Triggered Ethernet. [PDF]
Sensors (Basel)Zhu H, Li Z, Cheng J, Jin Z.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Approximating Satisfiable Satisfiability Problems
Algorithmica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
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
On the satisfiability of circumscription
Artificial Intelligence, 1986Es wird gezeigt: Wenn A erfüllbar ist und fast universal bezüglich P, so ist Circum(A;P) erfüllbar. Wenn A universal und erfüllbar ist, so ist Circum(A;P;Q) erfüllbar. Für disjunkte \(P^ 1,...,P^ k\), Q und jedes universale, erfüllbare A ist Circum(A,\(P^ 1>...>P^ k,Q)\) erfüllbar.
openaire +2 more sources
Approximating satisfiable satisfiability problems
1997We study the approximability of the Maximum Satisfiability Problem (MAX SAT) and of the boolean k-ary Constraint Satisfaction Problem (MAX kCSP) restricted to satisfiable instances. For both problems we improve on the performance ratios of known algorithms for the unrestricted case.
openaire +1 more source
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009
We give a simple introduction to satisfiability modulo theories intended fornon-specialists. No previous background is assumed.
openaire +1 more source
We give a simple introduction to satisfiability modulo theories intended fornon-specialists. No previous background is assumed.
openaire +1 more source
Reports Math. Log., 2021
Summary: A notion of satisfiability is defined for collections of vertex sets of a hypergraph and a method for determining satisfiability, called resolution, is introduced. An important special case is the resolution technique for determining satisfiability of a set of clauses in propositional logic.
openaire +2 more sources
Summary: A notion of satisfiability is defined for collections of vertex sets of a hypergraph and a method for determining satisfiability, called resolution, is introduced. An important special case is the resolution technique for determining satisfiability of a set of clauses in propositional logic.
openaire +2 more sources
Studia Logica, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source