16430 search results - page 2815 / 3286 » On Computable Tree Functions |
171
click to vote
EUROGP
2009
Springer
16 years 1 months ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
164
click to vote
FMCAD
2009
Springer
16 years 1 months ago
2009
Springer
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
185
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
179
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...
176
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...