1650 search results - page 98 / 330 » The HOM problem is decidable |
ROBVIS
2001
Springer
14 years 2 months ago
2001
Springer
This paper presents a wavelet-based algorithm for height from gradients. The tensor product of the third-order Daubechies’ scaling functions is used to span the solution space. ...
SIAMJO
2010
13 years 8 months ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
TACAS
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
EDBT
2006
ACM
14 years 10 months ago
2006
ACM
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
CIE
2007
Springer
14 years 4 months ago
2007
Springer
Ballester has shown that the problem of deciding whether a Nash stable partition exists in a hedonic game with arbitrary preferences is NP-complete. In this paper we will prove tha...