An Algorithm to Compute Inner Approximations of Relations for Interval Constraints.
Frédéric BenhamouFrédéric GoualardÉric LanguénouMarc ChristiePublished in: Ershov Memorial Conference (1999)
Keyphrases
- cost function
- detection algorithm
- optimization algorithm
- k means
- learning algorithm
- dynamic programming
- experimental evaluation
- computational cost
- tree structure
- closed form
- computationally efficient
- np hard
- optimal solution
- linear programming
- efficient computation
- particle swarm optimization
- constrained optimization
- improved algorithm
- computational complexity
- constraint propagation
- genetic algorithm
- multiple constraints
- matching algorithm
- attribute values
- segmentation algorithm
- theoretical analysis
- np complete
- input data
- evolutionary algorithm