16404 search results - page 231 / 3281 » A set coverage problem |
137
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
132
click to vote
CIDM
2009
IEEE
15 years 11 months ago
2009
IEEE
— Many real-world applications have problems when learning from imbalanced data sets, such as medical diagnosis, fraud detection, and text classification. Very few minority clas...
153
click to vote
ICTAI
2007
IEEE
15 years 10 months ago
2007
IEEE
Lookahead is a well-known constraint propagation technique for DPLL-based SAT and answer set solvers. Despite its space pruning power, it can also slow down the search, due to its...
132
Voted
CP
2004
Springer
15 years 9 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
161
click to vote
LICS
1999
IEEE
15 years 8 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...