344 search results - page 58 / 69 » The Santa Claus problem |
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Although the OWL Web Ontology Language adds considerable expressive power to the Semantic Web it does have expressive limitations, particularly with respect to what can be said ab...
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
LFCS
2009
Springer
15 years 4 months ago
2009
Springer
This work defines an extension CERES2 of the first-order cut-elimination method CERES to the subclass of sequent calculus proofs in second-order logic using quantifier-free comp...
SAT
2009
Springer
15 years 4 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...