default search action
Connection Science, Volume 12
Volume 12, Number 1, March 2000
- Bernard Ans, Stéphane Rousset:
Neural networks with a self-refreshing memory: knowledge transfer in sequential learning tasks without catastrophic forgetting. 1-19 - Hongjun Song, Stan Franklin:
A behaviour instantiation agent architecture. 21-44 - Steven Phillips:
Constituent similarity and systematicity: the limits of first-order connectionism. 45-63 - Gareth Howells, Michael C. Fairhurst, Fuad Rahman:
An exploration of a new paradigm for weightless RAM-based neural networks. 65-90 - Michael J. Spivey:
Turning the tables on the Turing test: the Spivey test. 91-94
Volume 12, Number 2, June 2000
- Robert F. Hadley:
Cognition and the computational power of connectionist networks. 95-110 - Mikael Bodén, Lars Niklasson:
Semantic systematicity and context in connectionist networks. 111-142 - Angelo Cangelosi, Alberto Greco, Stevan Harnad:
From robotic toil to symbolic theft: grounding transfer from entry-level to higher-level categories1. 143-162 - Peter Fletcher:
The foundations of connectionist computation. 163-196
Volume 12, Numbers 3-4, December 2000
- Mikael Bodén, Janet Wiles:
Context-free and context-sensitive dynamics in recurrent neural networks. 197-210 - Tony Savage:
Artificial motives: a review of motivation in artificial creatures. 211-277 - Cees van Leeuwen, Steven Verver, Martijn Brinkers:
Visual illusions, solid/outline invariance and non-stationary activity patterns. 279-297 - Lars Niklasson, Fredrik Linåker:
Distributed representations for extended syntactic transformation. 299-314 - Anne M. P. Canuto, Gareth Howells, Michael C. Fairhurst:
The use of confidence measures to enhance combination strategies in multi-network neuro-fuzzy systems. 315-331
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.