3D parallel tiled code implementing a modified Knuth's optimal binary search tree algorithm.
Wlodzimierz BieleckiPiotr BlaszynskiMaciej PoliwodaPublished in: J. Comput. Sci. (2021)
Keyphrases
- binary search trees
- dynamic programming
- optimal solution
- computational complexity
- learning algorithm
- detection algorithm
- parallel implementation
- k means
- cost function
- search space
- preprocessing
- computational cost
- optimization algorithm
- matching algorithm
- globally optimal
- worst case
- source code
- segmentation algorithm
- parallel algorithm
- optimal parameters
- gradient projection
- exhaustive search
- search tree
- search strategy
- combinatorial optimization
- simulated annealing
- probabilistic model
- np hard
- evolutionary algorithm
- high dimensional
- lower bound