A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games.
Laure DaviaudMarcin JurdzinskiRanko LazicPublished in: CoRR (2018)
Keyphrases
- computational cost
- detection algorithm
- gradient projection
- optimization algorithm
- experimental evaluation
- matching algorithm
- learning algorithm
- search space
- monte carlo
- dynamic programming
- computational complexity
- worst case
- high accuracy
- combinatorial optimization
- significant improvement
- k means
- np hard
- cost function
- simulated annealing
- neural network
- optimal solution
- incomplete information
- multi objective