Changes

Jump to: navigation, search

Persistent Hash Table

No change in size, 11:57, 19 May 2018
m
no edit summary
<span id="LearninginBebe"></span>
=Learning in Bebe=
[[Tony Scherzer|Tony]] and [[Linda Scherzer]], and [[Dean Tjaden]] further elaborate on the persistent hash table in their [[BeBeBebe#Award|award winning paper]] <ref>[[Tony Scherzer]], [[Linda Scherzer]], [[Dean Tjaden]] ('''1990'''). ''Learning in Bebe.'' [[Computers, Chess, and Cognition]] » [[BeBeBebe#Award|Mephisto Best-Publication Award]]</ref> concerning [[Learning]] in [[BeBeBebe]]:
==Short Term Memory==
* [[Arthur Samuel]] ('''1967'''). ''Some Studies in Machine Learning. Using the Game of Checkers. II-Recent Progress''. [http://pages.cs.wisc.edu/~dyer/cs540/handouts/samuel-checkers.pdf pdf]
* [[David Slate]] ('''1987'''). ''A Chess Program that uses its Transposition Table to Learn from Experience.'' [[ICGA Journal#10_2|ICCA Journal, Vol. 10, No. 2]]
* [[Tony Scherzer]], [[Linda Scherzer]], [[Dean Tjaden]] ('''1990'''). ''Learning in Bebe.'' [[Computers, Chess, and Cognition]] » [[BeBeBebe#Award|Mephisto Best-Publication Award]]
* [[Tony Scherzer]], [[Linda Scherzer]], [[Dean Tjaden]] ('''1991'''). ''Learning in Bebe.'' [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]]

Navigation menu