An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees.
Hao YuanPatrick Th. EugsterPublished in: ESOP (2009)
Keyphrases
- learning algorithm
- tree structure
- optimal solution
- preprocessing
- search space
- high accuracy
- computationally efficient
- improved algorithm
- convex hull
- matching algorithm
- ant colony optimization
- optimization algorithm
- theoretical analysis
- significant improvement
- computational complexity
- neural network
- segmentation algorithm
- computational cost
- times faster
- combinatorial optimization
- gradient projection
- dynamic programming
- k means
- reinforcement learning