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

RE: Gecco Noisy DFA Contest

Expand Messages
  • Lucas, Simon M
    Sorry - forgot the URL: http://cswww.essex.ac.uk/staff/sml/gecco/NoisyDFA.html Cheers, Simon ... From: Lucas, Simon M Sent: 04 June 2004 14:47 To:
    Message 1 of 2 , Jun 4, 2004
      Sorry - forgot the URL:

      http://cswww.essex.ac.uk/staff/sml/gecco/NoisyDFA.html

      Cheers,

      Simon

      -----Original Message-----
      From: Lucas, Simon M
      Sent: 04 June 2004 14:47
      To: 'genetic_programming@yahoogroups.com'
      Subject: Gecco Noisy DFA Contest



      Dear All,

      The deadline for the Noisy DFA
      contest is 11th June (Midnight,
      dateline west).

      Please note that I've updated the
      web page with details of the file
      format: this now makes it clear
      that your learning algorithm is
      told how many nomimal states are
      in the target DFA. Thanks go to
      Conor Ryan for querying this.

      It would be great to see more
      entries from the EC community.

      There are rumours that the smallest
      problem (the 10 state one) can
      be solved with a simple random
      mutation hill-climber operating
      directly in DFA space. I couldn't
      possibly comment on such rumours ;-)

      Best regards,

      Simon Lucas
      (Gecco 2004 Competitions Chair)


      --------------------------------------------------
      Dr. Simon Lucas
      Department of Computer Science
      University of Essex
      Colchester CO4 3SQ
      United Kingdom
      Email: sml@...

      http://cswww.essex.ac.uk/staff/lucas/lucas.htm
      --------------------------------------------------
    Your message has been successfully submitted and would be delivered to recipients shortly.