An algorithm computing combinatorial specifications of permutation classes.
Frédérique BassinoMathilde BouvelAdeline PierrotCarine PivoteauDominique RossinPublished in: Discret. Appl. Math. (2017)
Keyphrases
- learning algorithm
- optimal solution
- computational cost
- dynamic programming
- optimization algorithm
- computational complexity
- high accuracy
- experimental evaluation
- improved algorithm
- detection algorithm
- theoretical analysis
- preprocessing
- convergence rate
- significant improvement
- times faster
- worst case
- search space
- cost function
- matching algorithm
- classification algorithm
- objective function
- particle swarm optimization
- scheduling problem
- k means
- np hard
- linear programming
- feature selection
- motion estimation
- path planning
- memory requirements
- selection algorithm
- data sets