A branch and prune algorithm for the approximation of non-linear AE-solution sets.
Alexandre GoldsztejnPublished in: SAC (2006)
Keyphrases
- search space
- optimal solution
- objective function
- solution quality
- np hard
- approximation ratio
- significant improvement
- closed form
- particle swarm optimization
- learning algorithm
- times faster
- detection algorithm
- high accuracy
- experimental evaluation
- neural network
- numerical integration
- randomized algorithm
- mathematical model
- cost function
- k means
- search strategy
- solution space
- computational complexity
- approximation algorithms
- exact solution
- approximation methods
- greedy strategy
- computational cost
- global solution
- decomposition algorithm
- ant colony optimization
- dynamic programming
- expectation maximization
- level set