4513 search results - page 740 / 903 » Logic programming with satisfiability |
107
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
109
Voted
EOR
2008
15 years 3 months ago
2008
The problem of scheduling the production of new and recoverable defective items of the same product manufactured on the same facility is studied. Items are processed in batches. E...
123
Voted
FMSD
2006
15 years 3 months ago
2006
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
126
Voted
IJAIT
2006
15 years 3 months ago
2006
and renders an abstract color grid artwork reminiscent of early twentieth century abstract expressionism. Following Dewey's psychological interpretation of "aesthetic&quo...
137
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...