A Deterministic Algorithm for Constructing Multiple Rank-1 Lattices of Near-Optimal Size.
Craig GrossMark A. IwenLutz KämmererToni VolkmerPublished in: CoRR (2020)
Keyphrases
- computational complexity
- objective function
- learning algorithm
- detection algorithm
- optimization algorithm
- experimental evaluation
- dynamic programming
- theoretical analysis
- matching algorithm
- search space
- np hard
- space complexity
- memory requirements
- linear programming
- times faster
- path planning
- preprocessing
- cost function
- standard deviation
- tree structure
- expectation maximization
- high accuracy
- worst case
- clustering method
- neural network
- decision trees
- computationally efficient
- selection algorithm
- improved algorithm
- probabilistic model
- window size
- scoring function
- randomized algorithms
- relaxation algorithm