| 2006 | ||
|---|---|---|
| c10 | William A. Greene: A tree-based genetic algorithm for building rectilinear Steiner arborescences. GECCO 2006: 1179-1186 | |
| 2005 | ||
| c9 | ||
| 2004 | ||
| c8 | William A. Greene: Schema Disruption in Chromosomes That Are Structured as Binary Trees. GECCO (1) 2004: 1197-1207 | |
| 2003 | ||
| c7 | William A. Greene: A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms. GECCO 2003: 1582-1583 | |
| 2002 | ||
| c6 | William A. Greene: A Kernighan-Lin Local Improvement Heuristic that Softens Some Hard Problems in Genetic Algorithms. GECCO Late Breaking Papers 2002: 201-206 | |
| c5 | William A. Greene: A Genetic Algorithm With Self-distancing Bits But No Overt Linkage. GECCO 2002: 367-374 | |
| 2001 | ||
| j1 | William A. Greene: Genetic Algorithms for Partitioning Sets. International Journal on Artificial Intelligence Tools 10(1-2): 225-241 (2001) | |
| c4 | ||
| 2000 | ||
| c3 | ||
| c2 | ||
| 1985 | ||
| c1 | William A. Greene, Wayne Patterson: Using Galois fields in computer science (abstract only). ACM Conference on Computer Science 1985: 418 | |
| 1 | Wayne Patterson |
Data released under the ODC-BY 1.0 license — See also our legal information page