4908 search results - page 823 / 982 » On the Complexity of Optimal K-Anonymity |
207
click to vote
NC
1998
15 years 7 months ago
1998
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...
153
click to vote
NIPS
1992
15 years 7 months ago
1992
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
169
click to vote
WCE
2007
15 years 7 months ago
2007
—A dramatic and continuous increase in the complexity and size of websites on the Internet makes rather difficult to build such websites with required information to be easily fo...
187
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
184
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...