A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games.
Henrik BjörklundSergei G. VorobyovPublished in: Discret. Appl. Math. (2007)
Keyphrases
- experimental evaluation
- learning algorithm
- significant improvement
- detection algorithm
- optimization algorithm
- times faster
- computational cost
- similarity measure
- improved algorithm
- search strategy
- convex hull
- dynamic programming
- objective function
- computational complexity
- preprocessing
- k means
- probabilistic model
- selection algorithm
- cost function
- np hard
- theoretical analysis
- expectation maximization
- input data
- high accuracy
- segmentation algorithm
- computationally efficient
- tree structure
- matching algorithm
- linear programming
- worst case