6943 search results - page 269 / 1389 » Representations for evolutionary algorithms |
157
click to vote
ICDM
2007
IEEE
15 years 8 months ago
2007
IEEE
As technology advances we encounter more available data on moving objects, which can be mined to our benefit. In order to efficiently mine this large amount of data we propose an ...
SIAMDM
2008
15 years 4 months ago
2008
In a recent paper, Dur
113
click to vote
RP
2010
Springer
15 years 2 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
150
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
123
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
A string . . . a2a1a0 over the alphabet {−1, 0, 1} is said to be a minimal signed-binary representation of an integer n if n = k≥0 ak2k and the number of non-zero digits is ...