Sciweavers

620 search results - page 34 / 124
» Learning with Temporary Memory
Sort
View
ACL
1998
13 years 8 months ago
PAT-Trees with the Deletion Function as the Learning Device for Linguistic Patterns
In this study, a learning device based on the PATtree data structures was developed. The original PAT-trees were enhanced with the deletion function to emulate human learning comp...
Keh-Jiann Chen, Wen Tsuei, Lee-Feng Chien
GROUP
1997
ACM
13 years 11 months ago
Bridging the gap between face-to-face communication and long-term collaboration
During the different phases of a project, stakeholders have different communication needs and make use of different communication media to satisfy them. A group memory system must...
Stefanie N. Lindstaedt, Kurt Schneider
IJCAI
1997
13 years 8 months ago
Noise-Tolerant Windowing
Windowing has been proposed as a procedure for efficient memory use in the ID3 decision tree learning algorithm. However, it was shown that it may often lead to a decrease in perf...
Johannes Fürnkranz
CONNECTION
2006
101views more  CONNECTION 2006»
13 years 7 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
ICANN
2007
Springer
14 years 1 months ago
Solving Deep Memory POMDPs with Recurrent Policy Gradients
Abstract. This paper presents Recurrent Policy Gradients, a modelfree reinforcement learning (RL) method creating limited-memory stochastic policies for partially observable Markov...
Daan Wierstra, Alexander Förster, Jan Peters,...