An experimental analysis of Lemke-Howson algorithm
Bruno CodenottiStefano De RossiMarino PaganPublished in: CoRR (2008)
Keyphrases
- np hard
- cost function
- linear programming
- improved algorithm
- detection algorithm
- optimization algorithm
- dynamic programming
- learning algorithm
- optimal solution
- k means
- computationally efficient
- high accuracy
- experimental evaluation
- memory requirements
- times faster
- expectation maximization
- computational complexity
- preprocessing
- segmentation algorithm
- significant improvement
- classification algorithm
- tree structure
- theoretical analysis
- data sets
- support vector machine
- support vector machine svm
- similarity measure
- experimental study
- particle swarm optimization
- simulated annealing
- convergence rate
- recognition algorithm
- worst case