An algorithm to find optimal attack paths in nondeterministic scenarios.
Carlos SarrauteGerardo RicharteJorge Lucángeli ObesPublished in: AISec (2011)
Keyphrases
- dynamic programming
- worst case
- optimal solution
- high accuracy
- learning algorithm
- optimal path
- detection algorithm
- theoretical analysis
- globally optimal
- preprocessing
- np hard
- data sets
- linear programming
- experimental evaluation
- cost function
- computational complexity
- matching algorithm
- improved algorithm
- optimal strategy
- neural network
- k means
- lower bound
- optimization algorithm
- expectation maximization
- tree structure
- closed form
- times faster
- convergence rate
- recognition algorithm
- bayesian networks
- similarity measure
- decision trees
- path finding
- locally optimal