1144 search results - page 97 / 229 » Logic programming for combinatorial problems |
100
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
174
Voted
WEA
2010
Springer
15 years 9 months ago
2010
Springer
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
132
click to vote
IDEAS
2002
IEEE
15 years 7 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
179
Voted
POPL
2012
ACM
13 years 10 months ago
2012
ACM
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
128
click to vote
KDD
2009
ACM
15 years 7 months ago
2009
ACM
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...