218 search results - page 10 / 44 » Strong Bounds Consistencies and Their Application to Linear ... |
SOSP
2001
ACM
14 years 4 months ago
2001
ACM
As raw system and network performance continues to improve at exponential rates, the utility of many services is increasingly limited by availability rather than performance. A ke...
PODS
2001
ACM
14 years 7 months ago
2001
ACM
The paper investigates XML document speci cations with DTDs and integrity constraints, such as keysand foreign keys. We study the consistency problem of checking whether a given s...
MP
2002
13 years 7 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
IJCAI
2007
13 years 9 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
JCT
2010
13 years 6 months ago
2010
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...