4908 search results - page 74 / 982 » On the Complexity of Optimal K-Anonymity |
154
click to vote
CGO
2007
IEEE
16 years 16 days ago
2007
IEEE
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
163
click to vote
GLOBECOM
2007
IEEE
16 years 15 days ago
2007
IEEE
— This paper explores relay selection and selection diversity for coded cooperation in wireless sensor networks, with complexity constraints for the sensor nodes. In previous wor...
174
click to vote
GECCO
1999
Springer
15 years 10 months ago
1999
Springer
In this paper, we apply an evolutionary algorithm to learning behavior on a novel, interesting task to explore the general issue of learning e ective behaviors in a complex enviro...
126
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
215
click to vote
TEC
2002
15 years 5 months ago
2002
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...