Automated Problem Decomposition for the Boolean Domain with Genetic Programming

No abstract is available for this paper.

• Publication year

  2013

• Venue

  European Conference on Genetic Programming

• Publication date

  2013-04-03

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-642-37207-0_15
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Parallel Problem Solving from Nature - PPSN XII

  2012cited by this paper
• Geometric Semantic Genetic Programming

  2012influential reference
• EpochX: genetic programming in java with statistics and event monitoring

  2012cited by this paper
• Tag-based modules in genetic programming

  2011cited by this paper
• A non-destructive grammar modification approach to modularity in grammatical evolution

  2011cited by this paper
• Open issues in genetic programming

  2010cited by this paper
• The Automatic Acquisition, Evolution and Reuse of Modules in Cartesian Genetic Programming

  2008cited by this paper
• Solving the artificial ant on the Santa Fe trail problem in 20,696 fitness evaluations

  2007cited by this paper
• A Grammatical Genetic Programming Approach to Modularity in Genetic Algorithms

  2007cited by this paper
• Layered Learning in Boolean GP Problems

  2007cited by this paper
• Genetic and Evolutionary Computation – GECCO 2004

  2004cited by this paper
• Run Transferable Libraries - Learning Functional Bias in Problem Domains

  2004cited by this paper
• Evolving Modules in Genetic Programming by Subtree Encapsulation

  2001cited by this paper
• Partial functions in fitness-shared genetic programming

  2000cited by this paper
• Genetic programming III: Darwinian invention and problem solving [Book Review]

  1999cited by this paper
• Genetic Programming III: Darwinian Invention & Problem Solving

  1999cited by this paper
• The Evolutionary Induction of Subroutines

  1997cited by this paper
• Genetic Programming II: Automatic Discovery of Reusable Programs.

  1994influential reference
• Learning by adapting representations in genetic programming

  1994cited by this paper
• Coevolving High-Level Representations

  1993cited by this paper
• Genetic Programming: On the Programming of Computers by Means of Natural Selection

  1992influential reference

• Problem Decomposition Strategies and Credit Distribution Mechanisms in Modular Genetic Programming for Supervised Learning

  2025influential citation
• A semantic genetic programming framework based on dynamic targets

  2021cites this paper
• Genetic Programming: 23rd European Conference, EuroGP 2020, Held as Part of EvoStar 2020, Seville, Spain, April 15–17, 2020, Proceedings

  2020cites this paper
• SGP-DT: Semantic Genetic Programming Based on Dynamic Targets

  2020cites this paper
• Evolving autoencoding structures through genetic programming

  2019cites this paper
• A decomposition method for symbolic regression problems

  2018cites this paper
• Dynamic Programming Inspired Genetic Programming to Solve Regression Problems

  2017cites this paper
• Revisiting the Sequential Symbolic Regression Genetic Programming

  2016cites this paper
• Wave: Incremental Erosion of Residual Error

  2015cites this paper
• Heuristic procedures for improving the predictability of a genetic programming financial forecasting algorithm

  2015cites this paper
• Sequential Symbolic Regression with Genetic Programming

  2015influential citation
• Event-based graphical monitoring in the EpochX genetic programming framework

  2013cites this paper