Loading ...
Sorry, an error occurred while loading the content.

Benchmark problems for development

Expand Messages
  • Roland Olsson
    When developing novel GP methods, it is useful to compare new techniques with old ones on a suite of benchmark problems that are easily scalable in difficulty.
    Message 1 of 1 , Jan 30, 2002
    • 0 Attachment
      When developing novel GP methods, it is useful to compare new techniques
      with old ones on a suite of benchmark problems that are easily scalable in
      difficulty. The even-parity problem seems to be the most used such
      benchmark, but results obtained only on that problem are not necessarily
      generally valid.

      Even parity seems popular because:

      1. It is quite easy to compute fitness.

      2. It is hard for GP without ADFs.

      3. It is easy to scale by just increasing the number of variables.

      Can anyone suggest problems with similar properties that could be useful
      as test cases during development of new GP systems?


      Cheers,

      --
      Roland Olsson
      Department of Computer Science
      Ostfold College
      Norway

      +47 69215369
      Roland.Olsson@...
      http://www-ia.hiof.no/~rolando
    Your message has been successfully submitted and would be delivered to recipients shortly.