 | 2007 |
|---|
| 9 |       | Tim Paulden,
David K. Smith:
Some novel locality results for the blob code spanning tree representation.
GECCO 2007: 1320-1327 |
| 8 | | Tim Paulden,
David K. Smith:
Developing New Locality Results for the Prüfer Code using a Remarkable Linear-Time Decoding Algorithm.
Electr. J. Comb. 14(1): (2007) |
| 7 | | David K. Smith:
Dynamic programming and board games: A survey.
European Journal of Operational Research 176(3): 1299-1318 (2007) |
| 6 | | Evan Thompson,
Tim Paulden,
David K. Smith:
The Dandelion Code: A New Coding of Spanning Trees for Genetic Algorithms.
IEEE Trans. Evolutionary Computation 11(1): 91-100 (2007) |
| 2006 |
|---|
| 5 | | Tim Paulden,
David K. Smith:
From the Dandelion Code to the Rainbow Code: A Class of Bijective Spanning Tree Representations With Linear Complexity and Bounded Locality.
IEEE Trans. Evolutionary Computation 10(2): 108-123 (2006) |
| 2005 |
|---|
| 4 | | James J. Cai,
David K. Smith,
Xuhua Xia,
Kwok-yung Yuen:
MBEToolbox: a Matlab toolbox for sequence data analysis in molecular biology and evolution.
BMC Bioinformatics 6: 64 (2005) |
| 2004 |
|---|
| 3 | | Francis Y. L. Chin,
Henry C. M. Leung,
Siu-Ming Yiu,
Tak Wah Lam,
Roni Rosenfeld,
Wai Wan Tsang,
David K. Smith,
Y. Jiang:
Finding motifs for insufficient number of sequences with strong binding to transcription facto.
RECOMB 2004: 125-132 |
| 2002 |
|---|
| 2 | | David K. Smith:
Calculation of steady-state probabilities of M/M queues: further approaches.
JAMDS 6(1): 43-50 (2002) |
| 1990 |
|---|
| 1 | | F. A. Ogbu,
David K. Smith:
The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem.
Computers & OR 17(3): 243-253 (1990) |
