21 search results - page 5 / 5 » An integer programming approach for frequent itemset hiding |
ASPDAC
2005
ACM
13 years 10 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...