An Approximation Algorithm for Path Computation and Function Placement in SDNs.
Guy EvenMatthias RostStefan SchmidPublished in: CoRR (2016)
Keyphrases
- dynamic programming
- optimization algorithm
- experimental evaluation
- cost function
- learning algorithm
- k means
- theoretical analysis
- high accuracy
- detection algorithm
- matching algorithm
- recognition algorithm
- preprocessing
- computational complexity
- closed form
- efficient computation
- segmentation algorithm
- error function
- particle swarm optimization
- search space
- np hard
- times faster
- piecewise constant
- shortest path problem
- pointwise
- computational cost
- worst case
- input data
- expectation maximization
- monte carlo
- mobile robot
- neural network
- convex hull
- error bounds
- probabilistic model
- optimal solution
- objective function
- path length