An extension of Buchberger's algorithm to compute all reduced Gröbner bases of a polynomial ideal.
Klaus-Peter SchemmelPublished in: EUROCAL (1987)
Keyphrases
- computational complexity
- computational cost
- numerically stable
- cost function
- dynamic programming
- preprocessing
- k means
- learning algorithm
- improved algorithm
- convergence rate
- times faster
- detection algorithm
- optimal solution
- experimental evaluation
- particle swarm optimization
- theoretical analysis
- tree structure
- classification algorithm
- worst case
- segmentation algorithm
- search space
- computational efficiency
- objective function
- neural network
- constrained optimization
- decision trees
- recognition algorithm
- basis functions
- optimization algorithm
- probabilistic model
- significant improvement