A distant-parent selection rule in elitist GAs solves Jump_k in O(k 4^k n log n) expected time by using crossover to create and sustain diversity throughout the run.
Eremeev, and Per Kristian Lehre
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.NE 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Parent Selection Mechanisms in Elitist Crossover-Based Algorithms
A distant-parent selection rule in elitist GAs solves Jump_k in O(k 4^k n log n) expected time by using crossover to create and sustain diversity throughout the run.