Johan Parent

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Anne Defaweux

> Home > Persons > Johan Parent

Publications

2005
[c9]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/bnaic/ParentNDS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bnaic/ParentNDS05
Johan Parent, Ann Nowé, Anne Defaweux, Kris Steenhaut:
Compressed Linear Genetic Programming: empirical parameter study on the Even-n-parity problem. BNAIC 2005: 373-374
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/cec/ParentNSD05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cec/ParentNSD05
Johan Parent, Ann Nowé, Kris Steenhaut, Anne Defaweux:
Linear genetic programming using a compressed genotype representation. Congress on Evolutionary Computation 2005: 1164-1171
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/cec/DefaweuxLHP05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cec/DefaweuxLHP05
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, Johan Parent:
Complexity transitions in evolutionary algorithms: evaluating the impact of the initial population. Congress on Evolutionary Computation 2005: 2174-2181
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/gecco/DefaweuxLHP05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gecco/DefaweuxLHP05
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, Johan Parent:
Transition models as an incremental approach for problem solving in evolutionary algorithms. GECCO 2005: 599-606

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.