Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!purdue!mentor.cc.purdue.edu!pur-ee!pc.ecn.purdue.edu!cb.ecn.purdue.edu!androula
From: androula@cb.ecn.purdue.edu (Ioannis Androulakis)
Newsgroups: comp.ai.neural-nets
Subject: Genetic Algorithms
Message-ID: <947@cb.ecn.purdue.edu>
Date: 12 May 89 01:42:17 GMT
Reply-To: androula@cb.ecn.purdue.edu (Ioannis Androulakis)
Organization: Purdue University Engineering Computer Network
Lines: 11


 I would like to know if there has been any work done, concerning
 the application of Genetic Algorithms in cases where the search 
 space can not be represented by a prespecified and fixed string
 length. I am interested in applying GAs in synthesis problems
 and therfore I would like to have a greater flexibility in the
 representation. I would appreciate any help.
 Thank you,
 yannis

 androula@helium.ecn.purdue.edu