Semantic-based subtree crossover applied to dynamic problems

Files in This Item:
File Description SizeFormat 
kse.pdf79.08 kBAdobe PDFDownload
Title: Semantic-based subtree crossover applied to dynamic problems
Authors: Nguyen, Quang Uy
Murphy, Eoin
O'Neill, Michael
Nguyen, Xuan Hoai
Permanent link: http://hdl.handle.net/10197/3539
Date: 14-Oct-2011
Abstract: Although many real world problems are dynamic in nature, the study of Genetic Programming in dynamic environments is still immature. This paper investigates the application of some recently proposed semantic-based crossover operators on a series of dynamic problems. The operators studied include Semantic Similarity based Crossover and the Most Semantic Similarity based Crossover. The experimental results show the advantage of using semantic based crossovers when tackling dynamic problems.
Funding Details: Science Foundation Ireland
Irish Research Council for Science, Engineering and Technology
Type of material: Conference Publication
Publisher: IEEE
Copyright (published version): 2011 IEEE
Keywords: Genetic programmingSemanticsDynamic environmentsCrossover
Subject LCSH: Genetic programming (Computer science)
Semantics
Dynamic programming
DOI: 10.1109/KSE.2011.20
Other versions: http://dx.doi.org/10.1109/KSE.2011.20
Language: en
Status of Item: Peer reviewed
Is part of: Ho, Tu Bao et al. (eds.). KSE 2011 : the third international conference on knowledge and systems engineering [proceedings]
Conference Details: Presented at KSE 2011, The Third International Conference on Knowledge and Systems Engineering, Hanoi, Vietnam, 14-17 October, 2011
ISBN: 978-1-4577-1848-9
Appears in Collections:Computer Science Research Collection
CASL Research Collection

Show full item record

SCOPUSTM   
Citations 50

3
Last Week
0
Last month
checked on Oct 11, 2018

Page view(s) 20

163
checked on May 25, 2018

Download(s) 50

200
checked on May 25, 2018

Google ScholarTM

Check

Altmetric


This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.