An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups.
Ulla KoppenhagenErnst W. MayrPublished in: J. Symb. Comput. (2001)
Keyphrases
- dynamic programming
- optimal solution
- computational cost
- globally optimal
- learning algorithm
- computational complexity
- significant improvement
- computationally efficient
- simulated annealing
- worst case
- numerically stable
- closed form
- matching algorithm
- optimization algorithm
- objective function
- preprocessing
- search space
- k means
- similarity measure
- experimental evaluation
- optimality criterion
- optimal parameters
- particle swarm optimization
- segmentation algorithm
- optimal policy
- special case
- path planning
- convex hull
- level set
- regression problems
- cost function
- finding optimal
- np hard
- object detection