A discrete flower pollination algorithm for graph coloring problem.
Meriem BensouyadDjamel-Eddine SaïdouniPublished in: CYBCONF (2015)
Keyphrases
- objective function
- times faster
- computational complexity
- experimental evaluation
- image segmentation
- detection algorithm
- optimization algorithm
- matching algorithm
- high accuracy
- dynamic programming
- k means
- preprocessing
- learning algorithm
- cost function
- np hard
- search space
- path planning
- expectation maximization
- energy function
- theoretical analysis
- similarity measure
- continuous optimization
- discrete tomography
- computationally efficient
- particle swarm optimization
- worst case
- computational cost
- significant improvement
- video sequences