An Algorithm for Determining the Simplicity of a Modular Group Representation.
Gerhard O. MichlerPublished in: J. Symb. Comput. (1988)
Keyphrases
- learning algorithm
- experimental evaluation
- preprocessing
- computational cost
- particle swarm optimization
- times faster
- cost function
- theoretical analysis
- optimal solution
- high accuracy
- dynamic programming
- np hard
- convergence rate
- improved algorithm
- search space
- objective function
- computational complexity
- convex hull
- ant colony optimization
- clustering method
- single pass
- optimization algorithm
- segmentation algorithm
- computationally efficient
- input data
- genetic algorithm
- bayesian networks
- multi objective
- k means
- reinforcement learning