4908 search results - page 741 / 982 » On the Complexity of Optimal K-Anonymity |
178
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
152
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Evolution of multi-agent teams has been shown to be an effective method of solving complex problems involving the exploration of an unknown problem space. These autonomous and het...
161
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
This work examines the dendritic cell algorithm (DCA) from a mathematical perspective. By representing the signal processing phase of the algorithm using the dot product it is sho...
163
click to vote
ICANNGA
2009
Springer
16 years 1 months ago
2009
Springer
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
177
click to vote
ICHIT
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we provide an adaptive modulation approach that uses adaptive pilot symbols which both pilot spacing and power allocation on pilot symbols are optimized in single in...