38 search results - page 6 / 8 » On Complexity of Optimized Crossover for Binary Representati... |
GECCO
2010
Springer
13 years 8 months ago
2010
Springer
Genetic algorithms—a class of stochastic population-based optimization techniques—have been widely realized as the effective tools to solve complicated optimization problems ...
EMO
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The optimization and design of two different types of photonic devices - a Fibre Bragg Grating and a Microstructured Polymer Optical Fibre is presented in light of multi...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
DCC
2001
IEEE
14 years 4 months ago
2001
IEEE
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...