Hybrid divide-and-conquer approach for tree search algorithms.
Mathys RennelaAlfons LaarmanVedran DunjkoPublished in: CoRR (2020)
Keyphrases
- search algorithm
- tree search
- tree structure
- parallel tree search
- indexing schemes
- tree structures
- heuristic search
- index structure
- tree models
- data structure
- tree construction
- data sets
- hierarchical structure
- database
- b tree
- path finding
- tree nodes
- hybrid approaches
- classification trees
- branch and bound
- hybrid learning
- satisfiability problem
- search strategies
- tabu search
- similarity search
- multi dimensional
- association rules
- decision trees
- learning algorithm
- real time