局所探索法
1. Local search (optimization)In computer science, local search is a metaheuristic method for solving computationally hard optimization problems. Local search can be used on problems that can be formulated as finding a solution maximizing a criterion among a number of candidate solutions. Local search algorithms move from solution to solution in the space of candidate solutions (the search space) by applying local changes, until a solution deemed optimal is found or a time bound is elapsed.
Read “Local search (optimization)” on English Wikipedia
Read “局所探索法” on Japanese Wikipedia
Read “Local search (optimization)” on DBpedia
Read “Local search (optimization)” on English Wikipedia
Read “局所探索法” on Japanese Wikipedia
Read “Local search (optimization)” on DBpedia
Discussions
Log in to talk about this word.