Parallel distributed productivity-aware tree-search using Chapel.
Guillaume HelbecqueJan GmysNouredine MelabTiago CarneiroPascal BouvryPublished in: Concurr. Comput. Pract. Exp. (2023)
Keyphrases
- tree search
- parallel distributed
- university of north carolina
- branch and bound
- search algorithm
- constraint propagation
- search tree
- mathematical programming
- path finding
- search space
- north carolina
- monte carlo
- lower bound
- branch and bound algorithm
- neural network
- state space
- upper bound
- constraint programming
- digital government
- information technology