Sciweavers

165 search results - page 24 / 33
» A genetic algorithm for privacy preserving combinatorial opt...
Sort
View
TEC
2002
133views more  TEC 2002»
13 years 7 months ago
Learning and optimization using the clonal selection principle
The clonal selection principle is used to explain the basic features of an adaptive immune response to an antigenic stimulus. It establishes the idea that only those cells that rec...
Leandro Nunes de Castro, Fernando J. Von Zuben
GECCO
2004
Springer
125views Optimization» more  GECCO 2004»
14 years 23 days ago
Population-Based Iterated Local Search: Restricting Neighborhood Search by Crossover
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
Dirk Thierens
ICALP
2005
Springer
14 years 27 days ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
13 years 11 months ago
An efficient multi-objective evolutionary algorithm with steady-state replacement model
The generic Multi-objective Evolutionary Algorithm (MOEA) aims to produce Pareto-front approximations with good convergence and diversity property. To achieve convergence, most mu...
Dipti Srinivasan, Lily Rachmawati
DKE
2008
106views more  DKE 2008»
13 years 7 months ago
Towards optimal k-anonymization
When releasing microdata for research purposes, one needs to preserve the privacy of respondents while maximizing data utility. An approach that has been studied extensively in re...
Tiancheng Li, Ninghui Li