4908 search results - page 52 / 982 » On the Complexity of Optimal K-Anonymity |
148
click to vote
ERSHOV
2003
Springer
15 years 11 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
126
click to vote
4OR
2008
15 years 6 months ago
2008
This is a summary of the author's PhD thesis supervised by Marie-Christine Costa and Fr
135
click to vote
TCS
2008
15 years 6 months ago
2008
Distributed negotiation schemes offer one approach to agreeing an allocation of resources among a set of individual agents. Such schemes attempt to agree a distribution via a sequ...
148
click to vote
ANTS
1994
Springer
15 years 10 months ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
181
click to vote
COLOGNETWENTE
2010
15 years 4 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...