A Finite-Time Convergent Recurrent Neural Network Based Algorithm for the L Smallest k-Subsets Sum Problem.
Shenshen GuPublished in: ISNN (1) (2013)
Keyphrases
- improved algorithm
- dynamic programming
- times faster
- search space
- theoretical analysis
- learning algorithm
- objective function
- computational cost
- classification algorithm
- computational complexity
- tree structure
- detection algorithm
- cost function
- neural network
- estimation algorithm
- simulated annealing
- np hard
- probabilistic model
- preprocessing
- ant colony optimization
- data sets
- face recognition
- selection algorithm
- feed forward
- convergence rate
- similarity measure
- matching algorithm
- optimal solution
- k means
- optimization algorithm
- segmentation algorithm
- hidden markov models
- computationally efficient
- expectation maximization
- upper bound