A polynomial Time Subsumption Algorithm for Nominal Safe ELO⊥ under Rational Closure.
Giovanni CasiniUmberto StracciaThomas MeyerPublished in: Inf. Sci. (2019)
Keyphrases
- worst case
- dynamic programming
- experimental evaluation
- preprocessing
- detection algorithm
- high accuracy
- simulated annealing
- optimal solution
- computational complexity
- search space
- optimization algorithm
- theoretical analysis
- linear programming
- particle swarm optimization
- computational cost
- np hard
- special case
- k means
- learning algorithm
- matching algorithm
- approximation ratio
- cost function
- significant improvement
- similarity measure
- image sequences
- upper bound
- probabilistic model
- recognition algorithm
- improved algorithm