Studies in Abstract/Concrete Mappings in Proving Algorithm Correctness.
Arthur G. DuncanLawrence YelowitzPublished in: ICALP (1979)
Keyphrases
- dynamic programming
- preprocessing
- objective function
- detection algorithm
- computational complexity
- times faster
- learning algorithm
- computational cost
- optimization algorithm
- theoretical analysis
- cost function
- matching algorithm
- worst case
- experimental evaluation
- np hard
- high level
- single pass
- convergence rate
- schema mappings
- recognition algorithm
- path planning
- particle swarm optimization
- segmentation method
- ant colony optimization
- clustering method
- computationally efficient
- linear programming
- high accuracy
- similarity measure
- decision trees