1207 search results - page 66 / 242 » Towards optimal k-anonymization |
90
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. ...
112
click to vote
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
Most surrogate approaches to multi-objective optimization build a surrogate model for each objective. These surrogates can be used inside a classical Evolutionary Multiobjective O...
107
click to vote
SIAMSC
2010
14 years 11 months ago
2010
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...
111
Voted
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
114
click to vote
ATAL
2001
Springer
15 years 4 months ago
2001
Springer
This paper analyzes the process of automated negotiation between two competitive agents that have firm deadlines and incomplete information about their opponent. Generally speaking...