A Polynomial Time Algorithm for Spatio-Temporal Security Games.
Soheil BehnezhadMahsa DerakhshanMohammadTaghi HajiaghayiAleksandrs SlivkinsPublished in: CoRR (2017)
Keyphrases
- spatio temporal
- k means
- experimental evaluation
- theoretical analysis
- computational complexity
- preprocessing
- computational cost
- learning algorithm
- particle swarm optimization
- worst case
- optimization algorithm
- optimal solution
- times faster
- detection algorithm
- significant improvement
- expectation maximization
- objective function
- linear programming
- improved algorithm
- probabilistic model
- dynamic programming
- convergence rate
- max flow
- polynomial time complexity
- matching algorithm
- ant colony optimization
- clustering method
- simulated annealing
- high accuracy
- cost function
- special case