Jonathan Hallam

According to our database, Jonathan Hallam authored at least 6 papers between 2003 and 2007.

Collaborative distances:

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

2007

Optimal parameters for search using a barrier tree Markov model.

William Benfold, Jonathan Hallam, Adam Prügel-Bennett

Theor. Comput. Sci., 2007

2006

Barrier trees for studying search landscapes.

Jonathan Hallam

PhD thesis, 2006

2005

Large Barrier Trees for Studying Search.

Jonathan Hallam, Adam Prügel-Bennett

IEEE Trans. Evol. Comput., 2005

Barrier-based models of hard problems and crossover.

Jonathan Hallam, Adam Prügel-Bennett

Proceedings of the IEEE Congress on Evolutionary Computation, 2005

Optimal simulated annealing schedules for larger problems.

William Benfold, Jonathan Hallam, Adam Prügel-Bennett

Proceedings of the IEEE Congress on Evolutionary Computation, 2005

2003

Barrier Trees For Search Analysis.

Jonathan Hallam, Adam Prügel-Bennett

Proceedings of the Genetic and Evolutionary Computation, 2003