Take the 2-minute tour ×
Cross Validated is a question and answer site for people interested in statistics, machine learning, data analysis, data mining, and data visualization. It's 100% free, no registration required.

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.

http://en.wikipedia.org/wiki/Hill_climbing

share|improve this question
    
I tracked down the contributor who posted that pseudocode; it looks like he's still around, so I left him a message with a link to this question. So maybe he'll show up here. –  Jonathan Christensen Jan 18 '13 at 18:05

1 Answer 1

up vote 2 down vote accepted

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)

share|improve this answer
2  
Welcome to the site, @JohnForbes. One of our goals for CV is to develop a permanent repository of actionable information about stats in the form of answers to questions. As such, one thing we worry about is link rot. Would you mind editing your answer to include a standard citation, in case those links go dead? Since you're new here, you may want to read our about page & our FAQ, which contain info like this. –  gung Jan 22 '13 at 16:36

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.