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: (pp. 624-).

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: 1595936971
DOI: 10.1145/1276958.1277084
UCL classification: UCL > School of BEAMS
UCL > School of BEAMS > Faculty of Engineering Science
URI: http://discovery.ucl.ac.uk/id/eprint/43339
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item