83 search results - page 17 / 17 » Algorithms for SAT Based on Search in Hamming Balls |
COCO
2004
Springer
13 years 11 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
AUSDM
2007
Springer
14 years 2 months ago
2007
Springer
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...