Algorithm for Finding the Domain Intersection of a Set of Polytopes.
Vasyl TereshchenkoSergii ChevokinAndriy FisunenkoPublished in: ICCS (2013)
Keyphrases
- computational cost
- computational complexity
- genetic algorithm
- initial set
- lower and upper bounds
- convex hull
- high accuracy
- worst case
- probability distribution
- preprocessing
- objective function
- np hard
- search algorithm
- similarity measure
- input data
- ant colony optimization
- image segmentation
- recognition algorithm
- learning algorithm
- packing problem
- data sets
- decomposition algorithm