An efficient algorithm for searching implicit AND/OR graphs with cycles.
Pablo JiménezCarme TorrasPublished in: Artif. Intell. (2000)
Keyphrases
- dynamic programming
- learning algorithm
- times faster
- preprocessing
- computationally efficient
- high accuracy
- experimental evaluation
- improved algorithm
- detection algorithm
- linear programming
- cost function
- k means
- similarity measure
- np hard
- computational cost
- probabilistic model
- search space
- theoretical analysis
- segmentation algorithm
- computational complexity
- objective function
- simulated annealing
- optimization algorithm
- matching algorithm
- convergence rate
- graph structure