Travelled to:2 × USA
Collaborated with:R.Rankin N.Nemer-Preece M.Gower M.Insall L.Mullin T.B.Baird G.E.Peterson O.Shumsky W.McCune F.Erçal G.Harris J.Spring
Talks about:problem (3) algorithm (2) complet (2) genet (2) finit (2) constraint (1) polynomi (1) parallel (1) function (1) satisfi (1)
Person: Ralph W. Wilkerson
DBLP: Wilkerson:Ralph_W=
Contributed to:
19981997199619941993
1989Wrote 7 papers:
- SAC-1998-Nemer-PreeceW #algorithm #parallel #problem #satisfiability #search-based
- Parallel genetic algorithm to solve the satisfiability problem (NNP, RWW), pp. 23–28.
- SAC-1997-ShumskyWME #constraints #finite #first-order #generative #heuristic
- Direct finite first-order model generation with negative constraint propagation heuristic (OS, RWW, WM, FE), pp. 25–29.
- SAC-1996-GowerW #np-hard #problem
- R-by-C Crozzle: an NP-hard problem (MG, RWW), pp. 73–76.
- SAC-1994-InsallMW #finite
- Conjugating polynomials on finite rings (MI, LM, RWW), pp. 277–280.
- SAC-1993-RankinW #combinator #fixpoint #prolog #using
- Finding Fixed Point Combinators Using Prolog (RR, RWW), pp. 604–608.
- SAC-1993-RankinWHS #algorithm #evaluation #hybrid #problem #search-based
- A Hybrid Genetic Algorithm for an NP-Complete Problem with an Expensive Evaluation Function (RR, RWW, GH, JS), pp. 251–256.
- RTA-1989-BairdPW #commutative #reduction #set
- Complete Sets of Reductions Modulo Associativity, Commutativity and Identity (TBB, GEP, RWW), pp. 29–44.