4908 search results - page 780 / 982 » On the Complexity of Optimal K-Anonymity |
203
click to vote
GECCO
2005
Springer
16 years 3 days ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
169
click to vote
GECCO
2005
Springer
16 years 3 days ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
156
click to vote
HUC
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. We present Supple, a novel toolkit which automatically generates interfaces for ubiquitous applications. Designers need only specify declarative models of the interface a...
145
click to vote
ICDT
2005
ACM
16 years 2 days ago
2005
ACM
d abstract) Foto Afrati1 and Rada Chirkova2 1 Electrical and Computing Eng., National Technical University of Athens, 157 73 Athens, Greece 2 Computer Science Department, North Car...
180
click to vote
ICS
2005
Tsinghua U.
16 years 2 days ago
2005
Tsinghua U.
We propose an organization for the on-chip memory system of a chip multiprocessor, in which 16 processors share a 16MB pool of 256 L2 cache banks. The L2 cache is organized as a n...