ECJ-INTEREST-L Archives

January 2011

ECJ-INTEREST-L@LISTSERV.GMU.EDU

Options: Use Monospaced Font
Show HTML 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:
Sean Luke <[log in to unmask]>
Reply To:
ECJ Evolutionary Computation Toolkit <[log in to unmask]>
Date:
Mon, 31 Jan 2011 10:10:22 -0500
Content-Type:
text/plain
Parts/Attachments:
text/plain (28 lines)
On Jan 31, 2011, at 6:46 AM, Nikola N. wrote:

> // Test against random individuals of currrent population
>                for(int k = 0; k < numCurrent; k++)
>                    {
>                    for(int ind = 0; ind < inds.length; ind++)
>                        {
>                        if (ind == j) { inds[ind] =
> state.population.subpops[j].individuals[i]; updates[ind] = true; }
>     *                   else { inds[ind] =
> produce(selectionMethodCurrent[j], j, i, state, 0); updates[ind] =  
> false; }
>                        }
>    **                prob.evaluate(state,inds,updates, false,  
> subpops, 0);
>                    }

Ah!  Nikola, I suspect that the code should actually say

	produce(selectionMethodCurrent[ind], ind, i, state, 0);

This bug was stomped in the current code out on SVN.  In general the  
code on SVN for coevolution right now is MUCH better quality than the  
one in the snapshot: but beware, we're changing it almost daily in  
preparation for a paper.

Sean

ATOM RSS1 RSS2