๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Heuristic search in artificial intelligence

โœ Scribed by Weixiong Zhang; Rina Dechter; Richard E. Korf

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
41 KB
Volume
129
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Heuristic search in artificial intellige
Heuristic search in artificial intelligence
โœ Weixiong Zhang; Rina Dechter; Richard E. Korf ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 41 KB

In his 1950 paper entitled, "Programming a Computer to Play Chess" [3], Shannon laid out the theory of minimax search with bounded lookahead and static heuristic evaluation, the basis of almost all subsequent work on two-player games. Along with Allen Newell, Herbert Simon established the idea of he

Artificial intelligence in education: us
Artificial intelligence in education: using state space search and heuristics in mathematics instruction
โœ Anthony E. Kelly; D.H. Sleeman; Kenneth J. Gilhooly ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science โš– 765 KB

Two powerful techniques from AI-the use of heuristics, and state space analysis-are currently influencing the practice of pedagogy, particularly in mathematics. The current study compared the performance of college students on a mathematics task as a function of their exposure to each of these techn

Advanced study institute on artificial i
Advanced study institute on artificial intelligence and heuristic programming
โœ N.V. Findler; Bernard Meltzer ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 771 KB

All approaches to automatic pattern recognition or machine perception involve the initial assignment of a description to the pattern by the machine system in accordance with some predetermined rules or measurement procedures. The justification for adopting any particular set of rules or measurement

Heuristic search in restricted memory
Heuristic search in restricted memory
โœ P.P. Chakrabarti; S. Ghose; A. Acharya; S.C. de Sarkar ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 979 KB

Thts paper presents heurlsttc search algortthms whtch work wtthm memory constramts These algortthms, MA\* (for ordinary graphs) and MAO\* (for AND~OR graphs) guarantee admtsstble soluttons wlthm spectfied memory hmltattons (above the rnmtmum requtred) The memory versus node expanstons tradeoff ts an