407 search results - page 30 / 82 » Optimization of Linear Logic Programs Using Counting Methods |
ECAI
1992
Springer
13 years 11 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
APLAS
2005
ACM
14 years 1 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
This paper proposes a simple “prior-free” method for solving non-rigid structure-from-motion factorization problems. Other than using the basic low-rank condition, our method ...
ISLPED
2003
ACM
14 years 26 days ago
2003
ACM
The power consumption of a sequential circuit can be reduced by decomposing it into subcircuits which can be turned off when inactive. Power can also be reduced by careful state e...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...