4908 search results - page 707 / 982 » On the Complexity of Optimal K-Anonymity |
162
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
Stencil computation (SC) is of critical importance for broad scientific and engineering applications. However, it is a challenge to optimize complex, highorder SC on emerging clus...
182
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Evolutionary Computation is an exciting research field with the power to assist researchers in the task of solving hard optimization problems (i.e., problems where the exploitabl...
151
Voted
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...
192
click to vote
ASPLOS
2010
ACM
16 years 1 months ago
2010
ACM
In this paper we evaluate the atomic region compiler abstraction by incorporating it into a commercial system. We find that atomic regions are simple and intuitive to integrate i...
190
click to vote
ATAL
2007
Springer
16 years 26 days ago
2007
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...