Analyzing Parsons Puzzle Solutions using Modified Levenshtein's Algorithm.
Salil MaharjanAmruth KumarPublished in: CSEDM@EDM (2020)
Keyphrases
- optimal solution
- solution quality
- times faster
- learning algorithm
- computational complexity
- benchmark problems
- experimental evaluation
- np hard
- solution space
- computational cost
- high accuracy
- detection algorithm
- theoretical analysis
- improved algorithm
- selection algorithm
- data sets
- dynamic programming
- matching algorithm
- k means
- approximate solutions
- global solution
- expectation maximization
- distance function
- classification algorithm
- computational efficiency
- worst case
- convergence rate
- cost function
- preprocessing
- data structure
- gradient projection