| 2007 |
|---|
| 15 | EE | Matt D. Johnson,
Daniel R. Tauritz,
Ralph W. Wilkerson:
SNDL-MOEA: stored non-domination level MOEA.
GECCO 2007: 837-844 |
| 1998 |
|---|
| 14 | EE | Nicole Nemer-Preece,
Ralph W. Wilkerson:
Parallel genetic algorithm to solve the satisfiability problem.
SAC 1998: 23-28 |
| 1997 |
|---|
| 13 | EE | Olga Shumsky,
Ralph W. Wilkerson,
William McCune,
Fikret Erçal:
Direct finite first-order model generation with negative constraint propagation heuristic.
SAC 1997: 25-29 |
| 1996 |
|---|
| 12 | EE | Michelle Gower,
Ralph W. Wilkerson:
R-by-C Crozzle: an NP-hard problem.
SAC 1996: 73-76 |
| 1994 |
|---|
| 11 | EE | Matt Insall,
L. Mullin,
Ralph W. Wilkerson:
Conjugating polynomials on finite rings.
SAC 1994: 277-280 |
| 1993 |
|---|
| 10 | EE | Richard Rankin,
Ralph W. Wilkerson,
Geoff Harris,
Jo Spring:
A Hybrid Genetic Algorithm for an NP-Complete Problem with an Expensive Evaluation Function.
SAC 1993: 251-256 |
| 9 | EE | Richard Rankin,
Ralph W. Wilkerson:
Finding Fixed Point Combinators Using Prolog.
SAC 1993: 604-608 |
| 1990 |
|---|
| 8 | EE | Ralph W. Wilkerson,
Blayne E. Mayfield:
The Role of Term Symmetry in E-Completion Procedures.
ACM Conference on Computer Science 1990: 134-139 |
| 1989 |
|---|
| 7 | | Timothy B. Baird,
Gerald E. Peterson,
Ralph W. Wilkerson:
Complete Sets of Reductions Modulo Associativity, Commutativity and Identity.
RTA 1989: 29-44 |
| 6 | | Russell Greiner,
Barbara A. Smith,
Ralph W. Wilkerson:
A Correction to the Algorithm in Reiter's Theory of Diagnosis.
Artif. Intell. 41(1): 79-88 (1989) |
| 1988 |
|---|
| 5 | EE | Barbara A. Smith,
Ralph W. Wilkerson,
Gerald E. Peterson:
Automated Circuit Diagnosis Using First Order Logic Tools.
IEA/AIE (Vol. 1) 1988: 456-465 |
| 1987 |
|---|
| 4 | EE | Herbert H. Snyder,
Ralph W. Wilkerson:
A symbolic computation method of analytic solution of the mixed Direchlet-Neumann-Robin problem for LaPlace's equation.
ACM Conference on Computer Science 1987: 108-113 |
| 3 | EE | Ralph W. Wilkerson:
A routing algorithm for three stage rearrangeable Clos networks.
ACM Conference on Computer Science 1987: 235-238 |
| 2 | EE | Ralph M. Butler,
Selden Y. Trimble,
Ralph W. Wilkerson:
A logic programming model of the game of sprouts.
SIGCSE 1987: 319-323 |
| 1984 |
|---|
| 1 | | Ralph W. Wilkerson:
Symbolic Computation and the Dirichlet Problem.
EUROSAM 1984: 59-63 |
