Worst-case convergence times for Hopfield memories.
Patrik FloréenPublished in: IEEE Trans. Neural Networks (1991)
Keyphrases
- worst case
- associative memory
- lower bound
- average case
- upper bound
- greedy algorithm
- error bounds
- space complexity
- approximation algorithms
- databases
- worst case analysis
- stochastic approximation
- hopfield neural network
- faster convergence
- np hard
- case study
- artificial intelligence
- iterative algorithms
- search engine
- running times
- real time
- convergence property