|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Peer Review Status:||Refereed|
|Author(s):||Langdon, William B|
|Title:||Visualising the Search Landscape of the Triangle Program|
|Citation:||Langdon WB, Veerapen N & Ochoa G (2017) Visualising the Search Landscape of the Triangle Program In: McDermott J, Castelli M, Sekanina L, Haasdijk E, García-Sánchez P (ed.) EuroGP 2017: Genetic Programming, Cham, Switzerland: Springer. The 20th European Conference on Genetic Programming (EuroGP), 19.4.2017 - 21.4.2017, Amsterdam, The Netherlands, pp. 96-113.|
|Series/Report no.:||Lecture Notes in Computer Science, 10196|
|Conference Name:||The 20th European Conference on Genetic Programming (EuroGP)|
|Conference Location:||Amsterdam, The Netherlands|
|Abstract:||High order mutation analysis of a software engineering benchmark, including schema and local optima networks, suggests program improvements may not be as hard to find as is often assumed. 1) Bit-wise genetic building blocks are not deceptive and can lead to all global optima. 2) There are many neutral networks, plateaux and local optima, nevertheless in most cases near the human written C source code there are hill climbing routes including neutral moves to solutions.|
|Status:||Book Chapter: author post-print (pre-copy editing)|
|Rights:||Publisher policy allows this work to be made available in this repository; The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-55696-3_7|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.