4908 search results - page 155 / 982 » On the Complexity of Optimal K-Anonymity |
160
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
148
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper uses an entertaining student "sports" game to illustrate that GAs can be adapted to problems with uncertain properties and complexity. These problems can be s...
167
click to vote
AIPS
2007
15 years 8 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
204
click to vote
ACID
2006
15 years 7 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...