A feasible algorithm for typing in Elementary Affine Logic
Patrick BaillotKazushige TeruiPublished in: CoRR (2004)
Keyphrases
- np hard
- computational complexity
- theoretical analysis
- high accuracy
- worst case
- experimental evaluation
- dynamic programming
- cost function
- optimization algorithm
- path planning
- k means
- times faster
- convergence rate
- computational cost
- probabilistic model
- objective function
- linear programming
- matching algorithm
- detection algorithm
- improved algorithm
- ant colony optimization
- learning algorithm
- set theory
- segmentation algorithm
- computationally efficient
- input data
- significant improvement
- preprocessing
- optimal solution
- multiscale
- bayesian networks