4908 search results - page 345 / 982 » On the Complexity of Optimal K-Anonymity |
193
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Evolutionary problem decomposition techniques divide a complex problem into simpler subproblems, evolve individuals to produce subcomponents that solve the subproblems, and then a...
167
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Polymer microstructured optical fibres are a relatively recent development in optical fibre technology, supporting a wide variety of microstructure fibre geometries, when compared...
180
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
221
click to vote
MDM
2010
Springer
15 years 5 months ago
2010
Springer
— We introduce a novel strategy for data processing in Wireless Sensor Networks (WSNs) in the case of emergency fire evacuation with stringent delay constraints. Such networks sh...
183
click to vote
PODC
2004
ACM
16 years 6 days ago
2004
ACM
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...