AAAAAA
Results:
1-9
|
Results: 9
Authors:
KYEK O
PARBERRY I
WEGENER I
Citation: O. Kyek et al., BOUNDS ON THE NUMBER OF KNIGHTS TOURS, Discrete applied mathematics, 74(2), 1997, pp. 171-181
Authors:
PARBERRY I
Citation: I. Parberry, AN EFFICIENT ALGORITHM FOR THE KNIGHTS TOUR PROBLEM, Discrete applied mathematics, 73(3), 1997, pp. 251-260
Authors:
PARBERRY I
Citation: I. Parberry, SCALABILITY OF A NEURAL-NETWORK FOR THE KNIGHTS TOUR PROBLEM, Neurocomputing, 12(1), 1996, pp. 19-33
Authors:
PARBERRY I
Citation: I. Parberry, LOAD SHARING WITH PARALLEL PRIORITY-QUEUES, Journal of computer and system sciences, 50(1), 1995, pp. 64-73
Authors:
PARBERRY I
Citation: I. Parberry, A REAL-TIME ALGORITHM FOR THE (N(2)-1)-PUZZLE, Information processing letters, 56(1), 1995, pp. 23-28
Authors:
SORENSON J
PARBERRY I
Citation: J. Sorenson et I. Parberry, 2 FAST PARALLEL PRIME NUMBER SIEVES, Information and computation, 114(1), 1994, pp. 115-130
Authors:
PARBERRY I
Citation: I. Parberry, A GUIDE FOR NEW REFEREES IN THEORETICAL COMPUTER-SCIENCE, Information and computation, 112(1), 1994, pp. 96-116
Authors:
YAN PY
PARBERRY I
Citation: Py. Yan et I. Parberry, EXPONENTIAL SIZE LOWER BOUNDS FOR SOME DEPTH 3 CIRCUITS, Information and computation, 112(1), 1994, pp. 117-130
Authors:
OBRADOVIC Z
PARBERRY I
Citation: Z. Obradovic et I. Parberry, LEARNING WITH DISCRETE MULTIVALUED NEURONS, Journal of computer and system sciences, 49(2), 1994, pp. 375-390
Risultati:
1-9
|