A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One.
Stefan GöllerChristoph HaaseRanko LazicPatrick TotzkePublished in: ICALP (2016)
Keyphrases
- dynamic programming
- computational complexity
- learning algorithm
- experimental evaluation
- worst case
- times faster
- objective function
- cost function
- optimization algorithm
- high accuracy
- genetic algorithm
- space complexity
- detection algorithm
- expectation maximization
- linear programming
- special case
- significant improvement
- k means
- theoretical analysis
- segmentation algorithm
- search space
- matching algorithm
- improved algorithm
- strongly polynomial
- search algorithm
- tree structure
- image segmentation
- neural network
- min cost