やまのぼほう
山登り法
1. hill-climbing methodComputing
2. Hill climbingIn computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search. 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. If the change produces a better solution, an incremental change is made to the new solution, repeating until no further improvements can be found.
Read “Hill climbing” on English Wikipedia
Read “山登り法” on Japanese Wikipedia
Read “Hill climbing” on DBpedia
Read “Hill climbing” on English Wikipedia
Read “山登り法” on Japanese Wikipedia
Read “Hill climbing” on DBpedia
Discussions
Log in to talk about this word.