Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.
Susumu SuzukiToshihide IbarakiPublished in: Discret. Math. (2003)
Keyphrases
- improved algorithm
- scales linearly
- computational complexity
- standard deviation
- space complexity
- optimal solution
- dynamic programming
- optimization algorithm
- theoretical analysis
- computationally efficient
- input data
- computational cost
- experimental evaluation
- fixed size
- significant improvement
- preprocessing
- objective function
- learning algorithm
- worst case
- particle swarm optimization
- search space
- convex hull
- worst case time complexity
- window size
- data sets
- times faster
- path planning
- tree structure
- clustering method
- detection algorithm
- simulated annealing
- np hard
- image sequences
- genetic algorithm