Difference between revisions of "Hill Climbing"
From Cohen Courses
Jump to navigationJump to search (Created page with 'Hill climbing is a generic optimization method that is used for finding maxima and minima of a certain objective function. . It is an iterative algorithm that starts with an arbi…') |
(No difference)
|
Latest revision as of 21:57, 3 April 2011
Hill climbing is a generic optimization method that is used for finding maxima and minima of a certain objective function. . It is an iterative algorithm that starts with an arbitrary solution to a problem, then attempts to find a better solution by incrementally changing a single element of the solution. In a simple hill climbing implementation the direction of steepest ascent is chosen and a point is then picked.
