ECJ-INTEREST-L Archives

February 2014

ECJ-INTEREST-L@LISTSERV.GMU.EDU

Options: Use Monospaced Font
Show Text Part by Default
Show All Mail Headers

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

Print Reply
Subject:
From:
Raymond Shpeley <[log in to unmask]>
Reply To:
ECJ Evolutionary Computation Toolkit <[log in to unmask]>
Date:
Tue, 25 Feb 2014 21:01:49 -0500
Content-Type:
text/plain
Parts/Attachments:
text/plain (13 lines)
Forgot to mention the indices set needed to define the range of permutations for 
a given population set used in Initialiser and Breeder. Also, if the population size > 
than the number of permutations due to all permutation sets then all 
permutations can be defined to guarantee a full range, rather than relying on 
random chance. Don't know if this will be useful or not. Predefining populations 
with input constraints due to known permutations will lower non-survivors, so an 
early population of full permutations may result in developing superior generations 
more quickly.

Kinda looking forward to trying this one out.

-- ray

ATOM RSS1 RSS2