16404 search results - page 402 / 3281 » A set coverage problem |
207
click to vote
ICDT
2007
ACM
16 years 26 days ago
2007
ACM
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
147
click to vote
SAC
2005
ACM
16 years 8 days ago
2005
ACM
This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will...
189
click to vote
COCOON
2005
Springer
16 years 7 days ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
169
click to vote
SAC
2004
ACM
16 years 4 days ago
2004
ACM
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
234
Voted
LICS
2000
IEEE
15 years 11 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...