A subdivision algorithm to reason on high-degree polynomial constraints over finite domains.
Federico BergentiStefania MonicaPublished in: Ann. Math. Artif. Intell. (2019)
Keyphrases
- preprocessing
- computational complexity
- detection algorithm
- multiple constraints
- computational cost
- optimization algorithm
- simulated annealing
- high accuracy
- high efficiency
- dynamic programming
- cost function
- optimal solution
- learning algorithm
- polynomially bounded
- convergence rate
- times faster
- tree structure
- low degree
- theoretical analysis
- expectation maximization
- worst case
- segmentation algorithm
- input data
- recognition algorithm
- geometric constraints
- state space
- significant improvement
- objective function
- neural network