4908 search results - page 374 / 982 » On the Complexity of Optimal K-Anonymity |
166
click to vote
ICANNGA
2007
Springer
15 years 8 months ago
2007
Springer
Significant improvement over a patented lens design is achieved using multi-objective evolutionary optimization. A comparison of the results obtained from NSGA2 and ε-MOEA is done...
153
click to vote
EUROPAR
2008
Springer
15 years 8 months ago
2008
Springer
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...
193
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...
204
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Evolution Strategies (ES) for black-box optimization of a function f : Rn → R are investigated. Namely, we consider the cumulative step-size adaptation (CSA) for the variance of...
190
Voted
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
The evolution strategy is one of the strongest evolutionary algorithms for optimizing real-value vectors. In this paper, we study how to use it for the evolution of prediction wei...