ECJ-INTEREST-L Archives

September 2008

ECJ-INTEREST-L@LISTSERV.GMU.EDU

Options: Use Proportional Font
Show HTML Part by Default
Condense Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Mime-Version:
1.0
Content-Type:
text/plain
Date:
Thu, 18 Sep 2008 14:35:54 +0200
Reply-To:
ECJ Evolutionary Computation Toolkit <[log in to unmask]>
Subject:
From:
Tomasz Nowak <[log in to unmask]>
Content-Transfer-Encoding:
7bit
Sender:
ECJ Evolutionary Computation Toolkit <[log in to unmask]>
Comments:
Parts/Attachments:
text/plain (17 lines)
Hi,

I am trying to evolve an algoritm, that operates on arrays. Let's say,
there are 100 points with 10 attributes each, and I need to get a string
of 100 characters holding a decision for each point. The issue is that
the decision for each point is affected by attributes of preceding and
following points. 

Until now I just used as a terminal of one previous and one following
attribute and itereated over the loop, but the solutions are obviously
weak. Too weak.

What representation could I use in ECJ?

Best regards,
Tomasz

ATOM RSS1 RSS2