13784 search results - page 2275 / 2757 » On Computing Functions with Uncertainty |
183
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
181
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
204
click to vote
IWANN
2009
Springer
16 years 1 months ago
2009
Springer
Generating test data for formal state based specifications is computationally expensive. This paper improves a framework that addresses this issue by representing the test data ge...
168
click to vote
IWMM
2009
Springer
16 years 1 months ago
2009
Springer
Good spatial locality alleviates both the latency and bandwidth problem of memory by boosting the effect of prefetching and improving the utilization of cache. However, convention...
214
click to vote
IWSEC
2009
Springer
16 years 1 months ago
2009
Springer
Impossible boomerang attack [5] (IBA) is a new variant of differential cryptanalysis against block ciphers. Evident from its name, it combines the ideas of both impossible differ...