4117 search results - page 175 / 824 » On the Satisfiability of Complex Constraints |
153
click to vote
ISCC
2005
IEEE
16 years 4 days ago
2005
IEEE
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
162
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
168
click to vote
ADCM
2007
15 years 6 months ago
2007
We present a new method for reconstructing the density function underlying a given histogram. First we analyze the univariate case taking the approximating function in a class of q...
188
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
147
click to vote
SCL
2010
15 years 1 months ago
2010
We focus on the minimal time control problem for single-input control-affine systems x = X(x) + u1Y1(x) in IRn with fixed initial and final time conditions x(0) = ^x0, x(tf ) = ^x...