| 1993 |
|---|
| 8 | 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 |
| 7 | EE | Geoff Harris,
John Forster,
Richard Rankin:
Basic Blocks in Unconstrained Crossword Puzzles.
SAC 1993: 257-262 |
| 6 | EE | Richard Rankin,
Ralph W. Wilkerson:
Finding Fixed Point Combinators Using Prolog.
SAC 1993: 604-608 |
| 1990 |
|---|
| 5 | EE | Richard Rankin,
Hal Berghel,
T. Xu:
Efficient Generation of Lexically Proper Palindromes.
SIGSMALL/PC Symposium 1990: 151-155 |
| 4 | EE | Hal Berghel,
Richard Rankin,
Farrukh Burney:
An Approach to Tableau Inferencing with "Hardwired" Heuristics.
SIGSMALL/PC Symposium 1990: 90-93 |
| 3 | | Hal Berghel,
Richard Rankin:
A Proposed Standard for Measuring Crossword Compilation Efficiency.
Comput. J. 33(2): 181-184 (1990) |
| 1988 |
|---|
| 2 | EE | Richard Rankin:
Increasing the Efficiency of Prolog Lexical Databases with N-gram Boolean Cubes.
SIGSMALL/PC 1988: 161-166 |
| 1 | EE | Hal Berghel,
Richard Rankin,
Sanjiv K. Bhatia:
MS-DOS Prolog implementations revisited.
SIGPLAN Notices 23(1): 127-134 (1988) |
