Sciweavers

10 search results - page 1 / 2
» Achieving Efficient and Cognitively Plausible Learning in Ba...
Sort
View
ICML
2000
IEEE
14 years 8 months ago
Achieving Efficient and Cognitively Plausible Learning in Backgammon
Scott Sanner, John R. Anderson, Christian Lebiere,...
EMNLP
2008
13 years 9 months ago
Discriminative Learning of Selectional Preference from Unlabeled Text
We present a discriminative method for learning selectional preferences from unlabeled text. Positive examples are taken from observed predicate-argument pairs, while negatives ar...
Shane Bergsma, Dekang Lin, Randy Goebel
MICAI
2004
Springer
14 years 24 days ago
A Biologically Motivated and Computationally Efficient Natural Language Processor
Abstract. Conventional artificial neural network models lack many physiological properties of the neuron. Current learning algorithms are more concerned to computational performanc...
João Luís Garcia Rosa
IJCAI
1989
13 years 8 months ago
Constrained Heuristic Search
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
Mark S. Fox, Norman M. Sadeh, Can A. Baykan
CICC
2011
106views more  CICC 2011»
12 years 7 months ago
A 45nm CMOS neuromorphic chip with a scalable architecture for learning in networks of spiking neurons
Efforts to achieve the long-standing dream of realizing scalable learning algorithms for networks of spiking neurons in silicon have been hampered by (a) the limited scalability of...
Jae-sun Seo, Bernard Brezzo, Yong Liu, Benjamin D....