On fundamental design of parthenogenetic algorithm for the binary quadratic programming problem.
Kengo KatayamaHiroyuki NarihisaPublished in: CEC (2001)
Keyphrases
- learning algorithm
- dynamic programming
- theoretical analysis
- data sets
- experimental evaluation
- similarity measure
- times faster
- preprocessing
- cost function
- binary tree
- improved algorithm
- matching algorithm
- image restoration
- detection algorithm
- computationally efficient
- particle swarm optimization
- worst case
- computational cost
- np hard
- optimal solution
- simulated annealing
- least squares
- evolutionary algorithm
- feature space
- memory requirements
- image segmentation
- case study