• 2022-06-16
    Greedy method is a special case of local search.
    A: 正确
    B: 错误
  • B

    内容

    • 0

      If the search is to sequentially expand the nodes through a program close to the starting node, this search is called deep search.

    • 1

      There are two approaches to searching for a plan, one is ________________ search, and the other is backward relevant-states search.

    • 2

      Beam search的k=1时,就退化为Greedy decoding

    • 3

      In 2010, implement performance objective management for the special transfer payments allocated by the central government to local governments. A: 正确 B: 错误

    • 4

      What<br/>does Quentin Crisp think of the popular search for happiness?______ A: The search is not sensible. B: The media should be responsible for the search. C: You can surely find happiness without the help of some other person. D: It is advisable to make such a search together with some other<br/>person.