Great deluge algorithm: Difference between revisions

Content deleted Content added

Revision as of 03:02, 7 February 2017 edit Me, Myself, and I are Here (talk \| contribs) Extended confirmed users 107,043 edits m layout, bold ← Previous edit		Latest revision as of 03:59, 24 October 2022 edit undo Tony1 (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Template editors 279,030 edits →top
(One intermediate revision by the same user not shown)
Line 1: The '''Great ~~Deluge~~deluge algorithm''' ('''GD''') is a generic algorithm applied to [[Optimization (mathematics)\|optimization]] problems. It is similar in many ways to the [[hill-climbing]] and [[simulated annealing]] algorithms. The name comes from the analogy that in a great deluge a person climbing a hill will try to move in any direction that does not get his/her feet wet in the hope of finding a way up as the water level rises.