| Age | Commit message (Collapse) | Author |
|---|
|
|
|
It should work the same, but it selects the number of bits to mutate
first, then selects the individual bits instead of testing a random
number on each bit. For very large phenotypes this will be
significantly faster while producing about the same result.
|
|
|
|
It uses the forever-blocking variation of the Bu::SynchroQueue dequeue
to maximize efficiency.
|
|
It restarts the threads every generation. Maybe not the worst thing
every, but it seems like it would be better to stay in the thread and
notify the main thread that they're done with that iteration.
|
|
|
|
|
|
|
