16404 search results - page 430 / 3281 » A set coverage problem |
175
click to vote
ORL
2011
15 years 1 months ago
2011
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
171
click to vote
AMAI
1999
Springer
15 years 6 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
245
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
172
Voted
JGO
2011
15 years 1 months ago
2011
The maximal correlation problem (MCP) aiming at optimizing correlation between sets of variables plays a very important role in many areas of statistical applications. Currently, a...
172
click to vote
TKDE
2010
15 years 5 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...