Optimal communication algorithms for regular decompositions on the hypercube.
Geoffrey C. FoxWojtek FurmanskiPublished in: C³P (1988)
Keyphrases
- orders of magnitude
- worst case
- significant improvement
- dynamic programming
- times faster
- optimal solution
- graph theory
- recently developed
- theoretical analysis
- approximately optimal
- learning algorithm
- early stopping
- combinatorial optimization
- benchmark datasets
- computationally efficient
- computational cost
- search algorithm
- multi agent