Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

ICML
2000
IEEE

favoriteEmaildiscussreport

112views Machine Learning» more ICML 2000»

Achieving Efficient and Cognitively Plausible Learning in Backgammon

14 years 5 months ago

Achieving Efficient and Cognitively Plausible Learning in Backgammon

Download users.rsise.anu.edu.au

Scott Sanner, John R. Anderson, Christian Lebiere,

Real-time Traffic

ICML 2000 | Machine Learning | Plausible Learning |

claim paper

Related Content

» Discriminative Learning of Selectional Preference from Unlabeled Text

» A Biologically Motivated and Computationally Efficient Natural Language Processor

» Constrained Heuristic Search

» A 45nm CMOS neuromorphic chip with a scalable architecture for learning in networks of spi...

» groupTime preference based group scheduling

» Object localization based on directional information case of 2D vector data

» Predicting Learners Emotional Response in Intelligent Distance Learning Systems

» Unsupervised Segmentation With Dynamical Units

» Personalized elearning system using Item Response Theory

Post Info
More Details (n/a)

Added	17 Nov 2009
Updated	17 Nov 2009
Type	Conference
Year	2000
Where	ICML
Authors	Scott Sanner, John R. Anderson, Christian Lebiere, Marsha C. Lovett

Comments (0)