A deterministic subexponential algorithm for solving parity games.
Marcin JurdzinskiMike PatersonUri ZwickPublished in: SODA (2006)
Keyphrases
- np hard
- matching algorithm
- neural network
- k means
- cost function
- experimental evaluation
- theoretical analysis
- expectation maximization
- significant improvement
- computational cost
- optimization algorithm
- segmentation algorithm
- detection algorithm
- simulated annealing
- worst case
- times faster
- improved algorithm
- optimal solution
- objective function
- monte carlo
- recognition algorithm
- randomized algorithms
- particle swarm optimization
- high accuracy
- probabilistic model
- mobile robot
- preprocessing
- computational complexity
- similarity measure