A Constructive Algorithm for Partial Latin Square Extension Problem that Solves Hardest Instances Effectively.
Kazuya HaraguchiPublished in: WCO@FedCSIS (2013)
Keyphrases
- search algorithm
- search space
- randomly generated
- objective function
- improved algorithm
- dynamic programming
- computational complexity
- times faster
- lower and upper bounds
- particle swarm optimization
- experimental evaluation
- learning algorithm
- worst case
- data structure
- lower bound
- segmentation algorithm
- preprocessing
- matching algorithm
- tree structure
- optimal solution
- recognition algorithm
- knapsack problem
- path planning
- np hard
- metaheuristic
- expectation maximization
- high accuracy
- k means
- active learning