13 search results - page 2 / 3 » An Interval Constraint Branching Scheme for Lattice Domains |
SIGGRAPH
1992
ACM
13 years 11 months ago
1992
ACM
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
CP
2009
Springer
14 years 8 months ago
2009
Springer
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
ASAP
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
CP
2010
Springer
13 years 6 months ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...