| 2006 |
|---|
| 11 | EE | William A. Greene:
A tree-based genetic algorithm for building rectilinear Steiner arborescences.
GECCO 2006: 1179-1186 |
| 2005 |
|---|
| 10 | EE | William A. Greene:
Schema disruption in tree-structured chromosomes.
GECCO 2005: 1401-1408 |
| 2004 |
|---|
| 9 | EE | William A. Greene:
Schema Disruption in Chromosomes That Are Structured as Binary Trees.
GECCO (1) 2004: 1197-1207 |
| 2003 |
|---|
| 8 | EE | William A. Greene:
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms.
GECCO 2003: 1582-1583 |
| 2002 |
|---|
| 7 | | William A. Greene:
A Genetic Algorithm With Self-distancing Bits But No Overt Linkage.
GECCO 2002: 367-374 |
| 6 | | William A. Greene:
A Kernighan-Lin Local Improvement Heuristic that Softens Some Hard Problems in Genetic Algorithms.
GECCO Late Breaking Papers 2002: 201-206 |
| 2001 |
|---|
| 5 | EE | William A. Greene:
Dynamic Load-Balancing via a Genetic Algorithm.
ICTAI 2001: 121-128 |
| 4 | | William A. Greene:
Genetic Algorithms for Partitioning Sets.
International Journal on Artificial Intelligence Tools 10(1-2): 225-241 (2001) |
| 2000 |
|---|
| 3 | | William A. Greene:
Partitioning Sets with Genetic Algorithms.
FLAIRS Conference 2000: 102-106 |
| 2 | | William A. Greene:
A Non-Linear Schema Theorem for Genetic Algorithms.
GECCO 2000: 189-194 |
| 1985 |
|---|
| 1 | EE | William A. Greene,
Wayne Patterson:
Using Galois fields in computer science (abstract only).
ACM Conference on Computer Science 1985: 418 |
