Can anyone provide a reference for the Continuous Space Hill Climbing Algorithm pseudocode in the Wikipedia article on Hill Climbing? The Russell and Norvig text is cited, but they only provide the discrete case. I'm wondering where this particular version of the continuous case is first described.
These are pretty close matches:
Yuret, D. From Genetic Algorithms to Efficient Organization. Cambridge (MA): Massachusetts Institute of Technology; 1994. AI Technical Report No. 1569. (Available here)
Rosete, A., Ochoa, A., Sebag, M. “Automatic Graph Drawing and Stochastic Hill Climbing”, Proceedings of Genetic and Evolutionary Computation Conference, GECCO-99, Orlando, Banzhaf, W. Daida, J. Eiben, A. E. Garzon, M. H. Honavar, V. Jakiela, M. Smith, R. E. (Eds.), Morgan-Kaufmann, Vol. 2, 1699-1706, Julio 1999. (Available here)