| Class | Description |
|---|---|
| Fast |
Fast contains lots of magic numbers for speeding up Multiplexer,
basically arrays of bitfields representing the various on/off bit
values for all of the scoreboard permutations of 3, 6, and 11-multiplexer.
|
| Multiplexer |
Multiplexer implements the family of n-Multiplexer problems.
|
| MultiplexerData |
This is ugly and complicated because it needs to hold a variety
of different-length bitstrings, including temporary ones held
while computing subtrees.
|
Copyright © 2014 Evolutionary Computation Laboratory at George Mason University. All rights reserved.