Evaluating the impact of grammar complexity in automatic algorithm design.
Federico PagnozziThomas StützlePublished in: Int. Trans. Oper. Res. (2022)
Keyphrases
- computational complexity
- improved algorithm
- optimization algorithm
- worst case
- experimental evaluation
- significant improvement
- learning algorithm
- recognition algorithm
- space complexity
- k means
- computationally efficient
- dynamic programming
- computational cost
- high accuracy
- detection algorithm
- matching algorithm
- similarity measure
- segmentation algorithm
- preprocessing
- input data
- simulated annealing
- optimal solution
- np hard
- estimation algorithm
- natural language
- finite state automata
- neural network
- selection algorithm
- case study
- expectation maximization
- convergence rate
- classification algorithm
- theoretical analysis
- objective function
- cost function
- search space
- artificial neural networks