A fast and optimal deterministic algorithm for NP-Hard antenna selection problem.
Naveed IqbalChristian SchneiderReiner S. ThomäPublished in: PIMRC (2015)
Keyphrases
- np hard
- optimal solution
- worst case
- dynamic programming
- learning algorithm
- computational complexity
- linear programming
- computational cost
- detection algorithm
- locally optimal
- globally optimal
- high accuracy
- experimental evaluation
- cost function
- greedy heuristic
- exhaustive search
- closed form
- preprocessing
- special case
- scheduling problem
- simulated annealing
- lower bound
- optimization algorithm
- search space
- matching algorithm
- times faster
- convex hull
- minimum cost
- decision trees
- probabilistic model
- neural network