A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators.
José Antonio Andreu-GuzmánLuis Valencia-CabreraPublished in: J. Membr. Comput. (2020)
Keyphrases
- learning algorithm
- optimal solution
- np hard
- dynamic programming
- computational complexity
- detection algorithm
- search strategy
- preprocessing
- global optimum
- computationally efficient
- solution quality
- optimization algorithm
- experimental evaluation
- mathematical model
- initial solution
- computational efficiency
- times faster
- classification algorithm
- worst case
- cost function
- global solution
- improved algorithm
- search procedure
- iterative procedure
- greedy strategy
- simulated annealing
- matching algorithm
- least squares
- computational cost
- significant improvement
- search algorithm
- video sequences
- reinforcement learning
- similarity measure
- image segmentation