168 search results - page 22 / 34 » On Nontrivial Approximation of CSPs |
109
click to vote
ECSQARU
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. A great deal of research has been devoted to nontrivial reasoning in inconsistent knowledge bases. Coherence-based approaches proceed by a consolidation operation which s...
113
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
108
click to vote
DAM
2007
15 years 1 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
126
click to vote
PODS
2004
ACM
16 years 2 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
134
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...