Skip to main content

Research Repository

Advanced Search

All Outputs (2)

Walsh families of all rank-invariant classes of 3-bit pseudo-Boolean functions. [Dataset] (2016)
Dataset
CHRISTIE, L.A. 2016. Walsh families of all rank-invariant classes of 3-bit pseudo-Boolean functions. [Dataset]

This dataset was compiled as part of the following PhD thesis: CHRISTIE, L.A. 2016. The role of Walsh structure and ordinal linkage in the optimisation of pseudo-Boolean functions under monotonicity invariance. Robert Gordon University, PhD thesis. H... Read More about Walsh families of all rank-invariant classes of 3-bit pseudo-Boolean functions. [Dataset].

Generating easy and hard problems using the proximate optimality principle. [Dataset] (2015)
Dataset
MCCALL, J.A.W., CHRISTIE, L.A. and BROWNLEE, A.E.I. 2015. Generating easy and hard problems using the proximate optimality principle. [Dataset]

These data were gathered to investigate the hypothesis that coherent functions will be easy and anti-coherent functions will be hard for a hillclimber. We generated 10 coherent functions for each length on bit-strings of length 6-100 and the same num... Read More about Generating easy and hard problems using the proximate optimality principle. [Dataset].