4513 search results - page 626 / 903 » Logic programming with satisfiability |
137
Voted
SIAMDM
2011
14 years 11 months ago
2011
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
150
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
168
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach was developed in order to generate a dense disparity field. In ...
169
click to vote
ICCAD
2002
IEEE
16 years 1 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
142
click to vote
WINE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...