4908 search results - page 636 / 982 » On the Complexity of Optimal K-Anonymity |
184
click to vote
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
163
click to vote
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
155
click to vote
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
In order to overcome the low convergence speed and prematurity of classical genetic algorithm, an improved method named directional self-learning of genetic algorithm (DSLGA) is p...
161
click to vote
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
This paper evaluates a parallel genetic algorithm (GA) on the line topology of heterogeneous computing resources. Evolution process of parallel GAs is investigated on two types of...
167
click to vote
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
Researchers of HIV-1 are today, still unable to determine exactly the biological mechanisms that cause AIDS. Various mechanisms have been hypothesized and their existences have be...