Bio-inspired parameter-less heuristic for NP-hard (complete) discrete problems.
Manal ZettamPublished in: Int. J. Bio Inspired Comput. (2020)
Keyphrases
- bio inspired
- np hard
- np complete
- hybrid intelligent systems
- swarm intelligence
- optimal solution
- approximation algorithms
- approximate solutions
- special case
- lower bound
- scheduling problem
- exact algorithms
- computationally hard
- search algorithm
- modular neural networks
- simulated annealing
- tabu search
- computer vision
- artificial neural networks
- heuristic methods
- continuous variables
- np hardness
- low level image processing
- image analysis and pattern recognition