A Θ(n) Bound-Consistency Algorithm for the Increasing Sum Constraint.
Thierry PetitJean-Charles RéginNicolas BeldiceanuPublished in: CP (2011)
Keyphrases
- worst case
- preprocessing
- optimization algorithm
- objective function
- search space
- experimental evaluation
- dynamic programming
- constrained minimization
- particle swarm optimization
- theoretical analysis
- segmentation algorithm
- cost function
- times faster
- optimal solution
- improved algorithm
- detection algorithm
- convergence rate
- expectation maximization
- learning algorithm
- linear programming
- high accuracy
- computational cost
- np hard
- decision trees
- computationally efficient
- probabilistic model
- significant improvement
- matching algorithm
- k means
- computational complexity
- color constancy
- data sets
- square error