N. M. Stephens

According to our database, N. M. Stephens authored at least 6 papers between 1985 and 1999.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

1999

A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem.

D. Castelino, N. M. Stephens

Ann. Oper. Res., 1999

1997

A Divide-and-Conquer Technique to Solve the Frequency Assignment Problem.

A. T. Potter, N. M. Stephens

Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, 1997

Chaotic Neurodynamics in the Frequency Assignment Problem.

K. Dorkofikis, N. M. Stephens

Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, 1997

1996

A tabu search algorithm for frequency assignment.

D. J. Castelino, Stephen Hurley, N. M. Stephens

Ann. Oper. Res., 1996

1995

Constructing Educational Courseware Using NCSA Mosaic and the World-Wide Web.

J. K. Campbell, Stephen Hurley, S. B. Jones, N. M. Stephens

Comput. Networks ISDN Syst., 1995

1985

Lenstra's Factorization Method Based on Elliptic Curves.

N. M. Stephens

Proceedings of the Advances in Cryptology, 1985