4908 search results - page 812 / 982 » On the Complexity of Optimal K-Anonymity |
152
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Distributed allocation mechanisms rely on the agents' autonomous (and supposedly rational) behaviour: states evolve as a result of agents contracting deals and exchanging res...
196
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...
213
click to vote
AUSDM
2008
Springer
15 years 8 months ago
2008
Springer
Accurate and less invasive personalized predictive medicine can spare many breast cancer patients from receiving complex surgical biopsies, unnecessary adjuvant treatments and its...
189
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
140
click to vote
BPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The use of subprocesses in large process models is an important step in modeling practice to handle complexity. While there are several advantages attributed to such a mo...