1142 search results - page 20 / 229 » Approximability of Clausal Constraints |
101
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—Conserving network-wide energy consumption is becoming an increasingly important concern for network operators. In this work, we study network-wide energy conservation problem w...
103
click to vote
CP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
100
click to vote
ICDT
2001
ACM
15 years 4 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
CP
2008
Springer
15 years 1 months ago
2008
Springer
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...