Geoff P. McKeown

According to our database1, Geoff P. McKeown authored at least 15 papers between 1982 and 2007.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2007
A PROBE-Based Heuristic for Graph Partitioning.
IEEE Trans. Computers, 2007

Construction of factory schedules using reverse simulation.
Eur. J. Oper. Res., 2007

2005
Solving a Time-Space Network Formulation for the Convoy Movement Problem.
Oper. Res., 2005

2004
Hybridizing GRASP, PROBE and Path Relinking.
Proceedings of the Hybrid Metaheuristics, First International Workshop, 2004

2001
Application of GRASP to the Multiconstraint Knapsack Problem.
Proceedings of the Applications of Evolutionary Computing, 2001

1997
The Cryptanalysis of a Three Rotor Machine Using a Genetic Algorithm.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997

1993
Efficiency considerations in the implementation of parallel branch-and-bound.
Ann. Oper. Res., 1993

1991
Branch-and-bound as a higher-order function.
Ann. Oper. Res., 1991

1990
Applications of UET Scheduling Theory to the Implementation of Declarative Languages.
Comput. J., 1990

1988
The general problem solving algorithm and its implementation.
New Gener. Comput., 1988

On Process Assignment in Parallel Computing.
Inf. Process. Lett., 1988

1986
Iterated interpolation using a systolic array.
ACM Trans. Math. Softw., 1986

1985
A Special Purpose MIMD Parallel Processor.
Inf. Process. Lett., 1985

1984
Communication Problems on MIMD Parallel Computers.
Inf. Process. Lett., 1984

1982
Experiences in the use of color raster graphics at the University of East Anglia.
Comput. Graph. Forum, 1982


  Loading...