ECJ-INTEREST-L Archives

February 2014

ECJ-INTEREST-L@LISTSERV.GMU.EDU

Options: Use Monospaced 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
Content-Type:
multipart/alternative; boundary=047d7b8740b46e441604f1bc2991
Sender:
ECJ Evolutionary Computation Toolkit <[log in to unmask]>
Subject:
From:
J. Alejandro Zepeda Cortés <[log in to unmask]>
Date:
Thu, 6 Feb 2014 09:38:58 -0300
In-Reply-To:
MIME-Version:
1.0
Reply-To:
ECJ Evolutionary Computation Toolkit <[log in to unmask]>
Parts/Attachments:
text/plain (995 bytes) , text/html (2593 bytes)
Idea:

Terminals={Word,Number0to200}

Where Word is some word according to the index Number0to200 which is
evaluated following some logic.

Functions={Or, And, Not}



On Thu, Feb 6, 2014 at 9:21 AM, Laurie Hirsch <[log in to unmask]>wrote:

> Hi,
>
> I have trying to make a strongly type GP system to generate search
> queries.  The terminals are integers which point to a set of 200 words.
>  Internal functions take String arguments and produce a Boolean query which
> will return a specific set of documents (which determines the fitness):
>
> e.g. (word7 OR (word9 AND word200))
> .
> My question is what is the best way to specify the terminal set  - do I
> need to specify a node for every integer terminal or is there an equivalent
> of the GA min-gene /max gene approach?
>
> thanks,
>
> Laurie
>



-- 


--------------------------------------------------
J. Alejandro Zepeda Cortés
Ing. Civil Informático
TMóvil: +56-9-98184077
[log in to unmask]
--------------------------------------------------


ATOM RSS1 RSS2