Treatment of near-breakdown in the CGS algorithm.
Claude BrezinskiMichela Redivo-ZagliaPublished in: Numer. Algorithms (1994)
Keyphrases
- preprocessing
- computational complexity
- computationally efficient
- data sets
- improved algorithm
- detection algorithm
- np hard
- times faster
- experimental study
- optimization algorithm
- theoretical analysis
- high accuracy
- cost function
- scheduling problem
- probabilistic model
- input data
- experimental evaluation
- support vector machine svm
- segmentation algorithm
- significant improvement
- search space
- learning algorithm
- energy function
- recognition algorithm
- convergence rate
- hardware implementation
- classification algorithm
- tree structure
- simulated annealing
- optimal solution
- machine learning