Thomas Glyn Hinton

Learn More
—In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumptions of closure under permutation and non-revisiting algorithms. We then propose a new approach to reasoning about search algorithm performance, treating search algorithms as(More)
  • 1