Please use this identifier to cite or link to this item:
http://hdl.handle.net/1893/31579
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Petke, Justyna | en_UK |
dc.contributor.author | Alexander, Brad | en_UK |
dc.contributor.author | Barr, Earl T | en_UK |
dc.contributor.author | Brownlee, Alexander E I | en_UK |
dc.contributor.author | Wagner, Markus | en_UK |
dc.contributor.author | White, David R | en_UK |
dc.contributor.editor | López-Ibáñez, Manuel | en_UK |
dc.date.accessioned | 2020-08-20T00:08:44Z | - |
dc.date.available | 2020-08-20T00:08:44Z | - |
dc.date.issued | 2019 | en_UK |
dc.identifier.uri | http://hdl.handle.net/1893/31579 | - |
dc.description.abstract | Genetic Improvement (GI) uses automated search to improve existing software. Most GI work has focused on empirical studies that successfully apply GI to improve software's running time, fix bugs, add new features, etc. There has been little research into why GI has been so successful. For example, genetic programming has been the most commonly applied search algorithm in GI. Is genetic programming the best choice for GI? Initial attempts to answer this question have explored GI's mutation search space. This paper summarises the work published on this question to date. | en_UK |
dc.language.iso | en | en_UK |
dc.publisher | Association for Computing Machinery | en_UK |
dc.relation | Petke J, Alexander B, Barr ET, Brownlee AEI, Wagner M & White DR (2019) A Survey of Genetic Improvement Search Spaces. In: López-Ibáñez M (ed.) GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO '19 - Genetic and Evolutionary Computation Conference, Prague, Czech Republic, 13.07.2019-17.07.2019. New York: Association for Computing Machinery, pp. 1715-1721. https://doi.org/10.1145/3319619.3326870 | en_UK |
dc.rights | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. GECCO ’19 Companion, July 13–17, 2019, Prague, Czech Republic © 2019 Copyright held by the owner/author(s). Publication rights licensed to the Association for Computing Machinery. | en_UK |
dc.title | A Survey of Genetic Improvement Search Spaces | en_UK |
dc.type | Conference Paper | en_UK |
dc.identifier.doi | 10.1145/3319619.3326870 | en_UK |
dc.citation.spage | 1715 | en_UK |
dc.citation.epage | 1721 | en_UK |
dc.citation.publicationstatus | Published | en_UK |
dc.type.status | VoR - Version of Record | en_UK |
dc.contributor.funder | Engineering and Physical Sciences Research Council | en_UK |
dc.contributor.funder | EPSRC Engineering and Physical Sciences Research Council | en_UK |
dc.citation.btitle | GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion | en_UK |
dc.citation.conferencedates | 2019-07-13 - 2019-07-17 | en_UK |
dc.citation.conferencelocation | Prague, Czech Republic | en_UK |
dc.citation.conferencename | GECCO '19 - Genetic and Evolutionary Computation Conference | en_UK |
dc.citation.isbn | 978-1-4503-6748-6 | en_UK |
dc.publisher.address | New York | en_UK |
dc.contributor.affiliation | University College London | en_UK |
dc.contributor.affiliation | University of Adelaide | en_UK |
dc.contributor.affiliation | University College London | en_UK |
dc.contributor.affiliation | Computing Science | en_UK |
dc.contributor.affiliation | University of Adelaide | en_UK |
dc.contributor.affiliation | University of Sheffield | en_UK |
dc.identifier.isi | WOS:000538328100299 | en_UK |
dc.identifier.scopusid | 2-s2.0-85070602572 | en_UK |
dc.identifier.wtid | 1648739 | en_UK |
dc.contributor.orcid | 0000-0003-2892-5059 | en_UK |
dc.date.accepted | 2019-04-17 | en_UK |
dcterms.dateAccepted | 2019-04-17 | en_UK |
dc.date.filedepositdate | 2020-08-19 | en_UK |
dc.relation.funderproject | DAASE: Dynamic Adaptive Automated Software Engineering | en_UK |
dc.relation.funderref | EP/J017515/1 | en_UK |
rioxxterms.apc | not required | en_UK |
rioxxterms.type | Conference Paper/Proceeding/Abstract | en_UK |
rioxxterms.version | VoR | en_UK |
local.rioxx.author | Petke, Justyna| | en_UK |
local.rioxx.author | Alexander, Brad| | en_UK |
local.rioxx.author | Barr, Earl T| | en_UK |
local.rioxx.author | Brownlee, Alexander E I|0000-0003-2892-5059 | en_UK |
local.rioxx.author | Wagner, Markus| | en_UK |
local.rioxx.author | White, David R| | en_UK |
local.rioxx.project | EP/J017515/1|Engineering and Physical Sciences Research Council|http://dx.doi.org/10.13039/501100000266 | en_UK |
local.rioxx.contributor | López-Ibáñez, Manuel| | en_UK |
local.rioxx.freetoreaddate | 2020-08-19 | en_UK |
local.rioxx.licence | http://www.rioxx.net/licenses/all-rights-reserved|2020-08-19| | en_UK |
local.rioxx.filename | wksp187s2-file1.pdf | en_UK |
local.rioxx.filecount | 1 | en_UK |
local.rioxx.source | 978-1-4503-6748-6 | en_UK |
Appears in Collections: | Computing Science and Mathematics Conference Papers and Proceedings |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
wksp187s2-file1.pdf | Fulltext - Published Version | 923.35 kB | Adobe PDF | View/Open |
This item is protected by original copyright |
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.