loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)
Solving the even-n-parity problems using Best SubTree Genetic Programming
University of Edinburgh, Scotland, United Kingdom
August 05-August 08
ISBN: 0-7695-2866-X
ASCII Text
x 
 
Oana Muntean, Laura Diosan, Mihai Oltean, "Solving the even-n-parity problems using Best SubTree Genetic Programming," Adaptive Hardware and Systems, NASA/ESA Conference on, pp. 511-518, Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/AHS.2007.99,
author = {Oana Muntean and Laura Diosan and Mihai Oltean},
title = {Solving the even-n-parity problems using Best SubTree Genetic Programming},
journal ={Adaptive Hardware and Systems, NASA/ESA Conference on},
volume = {0},
year = {2007},
isbn = {0-7695-2866-X},
pages = {511-518},
doi = {http://doi.ieeecomputersociety.org/10.1109/AHS.2007.99},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Adaptive Hardware and Systems, NASA/ESA Conference on
TI - Solving the even-n-parity problems using Best SubTree Genetic Programming
SN - 0-7695-2866-X
SP511
EP518
A1 - Oana Muntean,
A1 - Laura Diosan,
A1 - Mihai Oltean,
PY - 2007
KW - null
VL - 0
JA - Adaptive Hardware and Systems, NASA/ESA Conference on
ER -
 
Oana Muntean, Babes-Bolyai University, Kogalniceanu 1, Cluj-Napoca, 400084, Romania.
Laura Diosan, Babes-Bolyai University, Kogalniceanu 1, Cluj-Napoca, 400084, Romania.
Mihai Oltean, Babes-Bolyai University, Kogalniceanu 1, Cluj-Napoca, 400084, Romania.
Best SubTree Genetic Programming (BSTGP) is a special Genetic Programming (GP) variant whose aim is to offer more possibilities, for selecting the solution, compared to standard GP. In the case of BSTGP the best subtree is chosen for proving the solution. This is different from standard GP where the solution was given by the entire tree. In this paper we apply BSTGP for designing digital circuits for the even-n-parity problem. Numerical results show that BSTGP can improve GP search in terms of success rate and computational effort.
Citation:
Oana Muntean, Laura Diosan, Mihai Oltean, "Solving the even-n-parity problems using Best SubTree Genetic Programming," ahs, pp.511-518, Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.