Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products.
Susumu SuzukiToshihide IbarakiPublished in: Electron. Notes Discret. Math. (2001)
Keyphrases
- optimization algorithm
- learning algorithm
- dynamic programming
- computational complexity
- cost function
- detection algorithm
- standard deviation
- times faster
- search space
- experimental evaluation
- high accuracy
- path planning
- neural network
- theoretical analysis
- memory requirements
- improved algorithm
- optimal solution
- np hard
- multi objective
- k means
- preprocessing
- window size
- selection algorithm
- worst case time complexity
- scales linearly
- computationally efficient
- expectation maximization
- maximum likelihood
- linear programming
- simulated annealing
- objective function
- clustering algorithm