8647 search results - page 409 / 1730 » The Container Selection Problem |
127
click to vote
SAT
2004
Springer
15 years 10 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
120
click to vote
AIPS
2003
15 years 6 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
164
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
233
Voted
ICDE
2000
IEEE
16 years 6 months ago
2000
IEEE
This paper introduces the concept of letting an RDBMS Optimizer optimize its own environment. In our project, we have used the DB2 Optimizer to tackle the index selection problem,...
131
Voted
CRV
2009
IEEE
15 years 11 months ago
2009
IEEE
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...