Now showing items 1-2 of 2
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 ...
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 ...