A Faster Algorithm for Finding Disjoint Paths in Grids.
Wun-Tat ChanFrancis Y. L. ChinHing-Fung TingPublished in: ISAAC (1999)
Keyphrases
- preprocessing
- k means
- experimental evaluation
- detection algorithm
- dynamic programming
- high accuracy
- computational complexity
- learning algorithm
- improved algorithm
- worst case
- probabilistic model
- times faster
- computationally efficient
- expectation maximization
- significant improvement
- neural network
- linear programming
- computational cost
- cost function
- optimization algorithm
- matching algorithm
- search space
- objective function
- highly efficient