Amanote Research

Amanote Research

  • Register
  • Sign In

Scalable Parallel Algorithms for Dynamic Programming on Tree Decomposition

doi 10.26756/th.2017.32

Full Text

Abstract

Available in

Date

Unknown

Authors

Mohamad M. Yassine

Publisher

Lebanese American University


Related search

Asynchronous Analysis of Parallel Dynamic Programming Algorithms

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
1996English

Parallel Logic Programming Systems on Scalable Architectures

Journal of Parallel and Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureTheoretical Computer ScienceArtificial IntelligenceSoftware
2000English

Parallel Algorithms for Singular Value Decomposition

Spanish

A Programming Environment for Parallel Vision Algorithms

1988English

Parallel Peak Pruning for Scalable SMP Contour Tree Computation

2016English

New Textbooks on Parallel Architectures, Algorithms and Programming

2015English

Separator-Based Pruned Dynamic Programming for Steiner Tree

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Low-Rank Methods for Parallelizing Dynamic Programming Algorithms

ACM Transactions on Parallel Computing
MathematicsSimulationHardwareComputer Science ApplicationsArchitectureModelingComputational TheorySoftware
2016Indonesian

A Scalable Core Migration Protocol for Dynamic Multicast Tree

English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy