A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size.
Craig GrossMark A. IwenLutz KämmererToni VolkmerPublished in: Adv. Comput. Math. (2021)
Keyphrases
- computational complexity
- dynamic programming
- optimization algorithm
- worst case time complexity
- times faster
- classification algorithm
- np hard
- reinforcement learning
- cost function
- worst case
- computational cost
- scales linearly
- memory requirements
- detection algorithm
- particle swarm optimization
- simulated annealing
- experimental evaluation
- learning algorithm
- significant improvement
- neural network
- similarity measure
- objective function
- search algorithm
- genetic algorithm
- space complexity
- standard deviation
- image segmentation
- ant colony optimization
- preprocessing
- segmentation algorithm
- k means
- rough sets
- probabilistic model