: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals.
Mohamed Saied Emam MohamedDaniel CabarcasJintai DingJohannes BuchmannStanislav BulyginPublished in: ICISC (2009)
Keyphrases
- objective function
- times faster
- high accuracy
- learning algorithm
- computational efficiency
- computationally efficient
- numerically stable
- improved algorithm
- preprocessing
- significant improvement
- dynamic programming
- cost function
- optimal solution
- search space
- computational complexity
- optimization algorithm
- matching algorithm
- detection algorithm
- algebraic equations
- highly efficient
- k means
- genetic algorithm
- path planning
- clustering method
- simulated annealing
- probabilistic model
- computational cost
- np hard