Amanote Research

Amanote Research

    RegisterSign In

Low-Rank Methods for Parallelizing Dynamic Programming Algorithms

ACM Transactions on Parallel Computing - United States
doi 10.1145/2884065
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsSimulationHardwareComputer Science ApplicationsArchitectureModelingComputational TheorySoftware
Date

March 15, 2016

Authors
Saeed MalekiMadanlal MusuvathiTodd Mytkowicz
Publisher

Association for Computing Machinery (ACM)


Related search

Low-Rank Semidefinite Programming for the MAX2SAT Problem

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Race Logic: A Hardware Acceleration for Dynamic Programming Algorithms

2014English

Scalable Parallel Algorithms for Dynamic Programming on Tree Decomposition

English

Asynchronous Analysis of Parallel Dynamic Programming Algorithms

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

Dynamic Programming-Based Search Algorithms in NLP

2009English

On Efficient Parallelizing of the Algorithms for Discrete Enumeration Problems

Machine Learning and Data Analysis
2015English

Run-Time Methods for Parallelizing Partially Parallel Loops

1995English

Dynamic Programming Algorithms for Producing Food Mixture Packages by Automatic Combination Weighers

Journal of Advanced Mechanical Design, Systems and Manufacturing
IndustrialMechanical EngineeringManufacturing Engineering
2014English

Algorithms for Nonlinear Programming.

1983English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy