请输入您要查询的百科知识:

 

词条 British Museum algorithm
释义

  1. See also

  2. Sources

  3. References

{{Use dmy dates|date=August 2015}}{{Use British English|date=August 2015}}{{graph search algorithm}}

The British Museum algorithm is a general approach to find a solution by checking all possibilities one by one, beginning with the smallest. The term refers to a conceptual, not a practical, technique where the number of possibilities is enormous.

Newell, Shaw, and Simon[1]

called this procedure the British Museum algorithm

"... since it seemed to them as sensible as placing monkeys in front of typewriters in order to reproduce all the books in the British Museum."

See also

  • Bogosort
  • Branch and bound
  • Breadth-first search
  • Brute-force search

Sources

  • Original text by {{DADS|British Museum technique|britishMuseum}}.

References

1. ^{{Cite journal | last1 = Newell | first1 = A. | authorlink1 = Allen Newell | last2 = Shaw | first2 = J. C. | authorlink2 = Cliff Shaw | last3 = Simon | first3 = H. A. | authorlink3 = Herbert A. Simon | year = 1958 | title = Elements of a Theory of Human Problem Solving | journal = Psychological Review | volume = 65 | issue = 3 | pages = 151-166 | publisher = American Psychological Association | jstor = | url = http://doi.library.cmu.edu/10.1184/pmc/simon/box00064/fld04878/bdl0001/doc0001 | doi = 10.1037/h0048495 | format = | accessdate = }}

2 : Algorithms|British Museum

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/11/13 23:41:05