Faster Black-Box Algorithms Through Higher Arity Operators

Details Faster Black-Box Algorithms Through Higher Arity Operators Faster Black-Box Algorithms Through Higher Arity Operators

2010-12-04

arxiv.org/abs/1012.0952v1

Computer Science

Neural and Evolutionary Computing

To appear at FOGA 2011

Scientific paper

We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-box model by considering higher arity variation operators. In particular, we show that already for binary operators the black-box complexity of \leadingones drops from $\Theta(n^2)$ for unary operators to $O(n \log n)$. For \onemax, the $\Omega(n \log n)$ unary black-box complexity drops to O(n) in the binary case. For $k$-ary operators, $k \leq n$, the \onemax-complexity further decreases to $O(n/\log k)$.

Affiliated with

Also associated with

No associations

Rating

Faster Black-Box Algorithms Through Higher Arity Operators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Faster Black-Box Algorithms Through Higher Arity Operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Faster Black-Box Algorithms Through Higher Arity Operators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-517260