Sciweavers

9949 search results - page 1649 / 1990
» On the Network Complexity of Selection
Sort
View
ECCC
2000
158views more  ECCC 2000»
15 years 6 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
IJON
2002
154views more  IJON 2002»
15 years 6 months ago
Nonlinear model predictive control of a cutting process
Nonlinear model predictive control (MPC) of a simulated chaotic cutting process is presented. The nonlinear MPC combines a neural-network model and a genetic-algorithm-based optim...
Primoz Potocnik, Igor Grabec
NPL
2002
110views more  NPL 2002»
15 years 6 months ago
Biologically Plausible Associative Memory: Continuous Unit Response + Stochastic Dynamics
A neural network model of associative memory is presented which unifies the two historically more relevant enhancements to the basic Little-Hopfield discrete model: the graded resp...
Enrique Carlos Segura Meccia, Roberto P. J. Perazz...
TVLSI
1998
88views more  TVLSI 1998»
15 years 6 months ago
Time multiplexed color image processing based on a CNN with cell-state outputs
—A practical system approach for time-multiplexing cellular neural network (CNN) implementations suitable for processing large and complex images using small CNN arrays is presen...
Lei Wang, José Pineda de Gyvez, Edgar S&aac...
TELSYS
2002
73views more  TELSYS 2002»
15 years 6 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner
« Prev « First page 1649 / 1990 Last » Next »