An Optimal Algorithm for Finding All Convex Subsets in Tournaments.
Marty J. WolfDavid J. HaglinPublished in: Ars Comb. (1999)
Keyphrases
- dynamic programming
- detection algorithm
- globally optimal
- worst case
- piecewise linear
- high accuracy
- k means
- experimental evaluation
- optimal solution
- np hard
- computationally efficient
- probabilistic model
- convex hull
- preprocessing
- computational complexity
- exhaustive search
- matching algorithm
- optimal strategy
- convex optimization
- recognition algorithm
- computational cost
- cost function
- objective function
- neural network
- learning algorithm
- finding optimal
- locally optimal
- optimality criterion
- space complexity
- convergence rate
- times faster
- clustering method
- particle swarm optimization
- multi objective
- reinforcement learning