Greedy method is a special case of local search.
举一反三
- Greedy method is a special case of local search. A: 正确 B: 错误
- In a database, there are usually two ways of search, i.e., basic search and a_________ search.
- Hill climbing search is sometimes called greedy local search because it grabs a good neighbor state without thinking ahead about where to go next. Unfortunately, it often gets stuck for the three reasons:
- If the search is to sequentially expand the nodes through a program close to the starting node, this search is called deep search.
- There are two approaches to searching for a plan, one is ________________ search, and the other is backward relevant-states search.