UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Why is parity hard for estimation of distribution algorithms?

Coffin, DJ; Smith, RE; (2007) Why is parity hard for estimation of distribution algorithms? In: GECCO '07: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation. (pp. 624 - 624). ACM Press: New York, US.

Full text not available from this repository.

Abstract

We describe a k-bounded and additively separable test problem on which the hierarchical Bayesian Optimization Algorithm (hBOA) scales exponentially.

Type:Proceedings paper
Title:Why is parity hard for estimation of distribution algorithms?
ISBN-13:9781595936974
DOI:10.1145/1276958.1277084
Publisher version:http://dx.doi.org/10.1145/1276958.1277084
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Computer Science

Archive Staff Only: edit this record