Solving the even parity problems using best SubTree genetic programming

被引：0
|
作者：
Muntean, Oana [1 ]
Diosan, Laura [1 ]
Oltean, Mihai [1 ]
机构：
[1] Babes Bolyai Univ, Fac Math & Comp Sci, Dept Comp Sci, Kogalniceanu 1, Cluj Napoca 400084, Romania
来源：
NASA/ESA CONFERENCE ON ADAPTIVE HARDWARE AND SYSTEMS, PROCEEDINGS | 2007年
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：511 / +
页数：2
相关论文
共 50 条
  • [1] Solving even-parity problems using traceless genetic programming
    Oltean, M
    [J]. CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, : 1813 - 1819
  • [2] Solving even-parity problems using multi expression programming
    Oltean, M
    [J]. PROCEEDINGS OF THE 7TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2003, : 315 - 318
  • [3] Best SubTree Genetic Programming
    Muntean, Oana
    Diosan, Laura
    Oltean, Mihai
    [J]. GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 1667 - 1673
  • [4] Solving mathematical programming problems using genetic algorithms
    Malasri, S
    Martin, JR
    Medina, RA
    [J]. COMPUTING IN CIVIL ENGINEERING, 1996, : 233 - 239
  • [5] Solving curve fitting problems using genetic programming
    Kamal, HA
    Eassa, MH
    [J]. 11TH IEEE MEDITERRANEAN ELECTROTECHNICAL CONFERENCE, PROCEEDINGS, 2002, : 316 - 321
  • [6] Solving classification problems using infix form genetic programming
    Oltean, M
    Grosan, C
    [J]. ADVANCES IN INTELLIGENT DATA ANALYSIS V, 2003, 2810 : 242 - 253
  • [7] Solving Classification Problems Using Genetic Programming Algorithms on GPUs
    Cano, Alberto
    Zafra, Amelia
    Ventura, Sebastian
    [J]. HYBRID ARTIFICIAL INTELLIGENCE SYSTEMS, PT 2, 2010, 6077 : 17 - 26
  • [8] Using subtree crossover distance to investigate genetic programming dynamics
    Vanneschi, Leonardo
    Gustafson, Steven
    Mauri, Giancarlo
    [J]. GENETIC PROGRAMMING, PROCEEDINGS, 2006, 3905 : 238 - 249
  • [9] Solving Real-valued Optimisation Problems using Cartesian Genetic Programming Genetic Programming Track
    Walker, James Alfred
    Miller, Julian Francis
    [J]. GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 1724 - 1730
  • [10] Alternatives in subtree caching for genetic programming
    Keijzer, M
    [J]. GENETIC PROGRAMMING, PROCEEDINGS, 2004, 3003 : 328 - 337
12345