Show simple item record

dc.contributor.authorChristie, Lee A.
dc.date.accessioned2016-08-19T13:54:40Z
dc.date.available2016-08-19T13:54:40Z
dc.date.issued2016-02-01
dc.identifier.citationCHRISTIE, L.A. 2016. Walsh families of all rank-invariant classes of 3-bit pseudo-Boolean functions. [Dataset]. Held on OpenAIR [online]. Available from: http://hdl.handle.net/10059/1585
dc.identifier.urihttp://hdl.handle.net/10059/1585
dc.descriptionThe data consists of a single ZIP file containing two scripts in Python and C, and two plain text files containing a list of 3-bit classes and their respective Walsh families. A further text file contains instructions in English for running the code.
dc.description.abstractThis 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. Held on OpenAIR [online]. Available from: http://hdl.handle.net/10059/1567. The aim of this thesis was to investigate the role that problem structure plays in heuristic optimisation, developing a classification of pseudo-Boolean functions based on rank-invariance. The thesis provides insight into the relationship between function structure and problem difficulty for optimisation, which may be used to direct the development of novel algorithms.en
dc.language.isoengen
dc.publisherOpenAIR@RGU
dc.relation.isreferencedbyCHRISTIE, 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. Held on OpenAIR [online]. Available from: http://hdl.handle.net/10059/1567en
dc.relation.isreferencedbyCHRISTIE, L.A., MCCALL, J.A.W. and LONIE, D.P. 2014. Minimal Walsh structure and ordinal linkage of monotonicity-invariant function classes on bit strings. In the Proceedings of the 2014 Annual conference on genetic and evolutionary computation (GECCO '14), 12-16 July 2014, Vancouver, BC, USA. New York: ACM, pages 333-340. Held on OpenAIR [online]. Available from: https://hdl.handle.net/10059/1384
dc.relation.urihttp://hdl.handle.net/10059/1567
dc.relation.urihttps://hdl.handle.net/10059/1384
dc.rightshttps://creativecommons.org/licences/by-nc-nd/4.0en
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectHeuristicsen
dc.subjectPseudo-Boolean functionsen
dc.subjectWalsh analysisen
dc.subjectProblem structuresen
dc.titleWalsh families of all rank-invariant classes of 3-bit pseudo-Boolean functions. [Dataset]en
dc.typeDatasetsen
dcterms.publicationdate2016-02-01
rioxxterms.publicationdate2016-02-01
rioxxterms.typeOther


Files in this item

This item appears in the following Collection(s)

Show simple item record

https://creativecommons.org/licences/by-nc-nd/4.0
Except where otherwise noted, this item's license is described as https://creativecommons.org/licences/by-nc-nd/4.0