| |
| 2007 | ||
|---|---|---|
| 5 | EE | William Benfold, Jonathan Hallam, Adam Prügel-Bennett: Optimal parameters for search using a barrier tree Markov model. Theor. Comput. Sci. 386(1-2): 94-113 (2007) |
| 2005 | ||
| 4 | EE | William Benfold, Jonathan Hallam, Adam Prügel-Bennett: Optimal simulated annealing schedules for larger problems. Congress on Evolutionary Computation 2005: 1119-1126 |
| 3 | EE | Jonathan Hallam, Adam Prügel-Bennett: Barrier-based models of hard problems and crossover. Congress on Evolutionary Computation 2005: 1661-1666 |
| 2 | EE | Jonathan Hallam, Adam Prügel-Bennett: Large Barrier Trees for Studying Search. IEEE Trans. Evolutionary Computation 9(4): 385-397 (2005) |
| 2003 | ||
| 1 | EE | Jonathan Hallam, Adam Prügel-Bennett: Barrier Trees For Search Analysis. GECCO 2003: 1586-1587 |
| 1 | William Benfold | [4] [5] |
| 2 | Adam Prügel-Bennett | [1] [2] [3] [4] [5] |