On Efficient Parallelizing of the Algorithms for Discrete Enumeration Problems

Machine Learning and Data Analysis
doi 10.21469/22233792.1.13.07
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Computing Centre of the Russian Academy of Sciences

Related search

Efficient and Practical Algorithms for Discrete Geodesics

English

Edge Dominating Set: Efficient Enumeration-Based Exact Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Low-Rank Methods for Parallelizing Dynamic Programming Algorithms

ACM Transactions on Parallel Computing
MathematicsSimulationHardwareComputer Science ApplicationsArchitectureModelingComputational TheorySoftware
2016English

Efficient Parallel Algorithms for a Class of Graph Theoretic Problems

SIAM Journal on Computing
MathematicsComputer Science
1984English

I/O-Efficient Algorithms for Shortest Path Related Problems

English

Algorithms for Range Restricted Iterative Methods for Linear Discrete Ill-Posed Problems

Numerical Algorithms
Applied Mathematics
2011English

Efficient Discrete-Time Simulations of Continuous-Time Quantum Query Algorithms

2009English

On Modern Array Algorithms for Optimal Discrete Filtering

Bulletin of the South Ural State University, Series: Mathematical Modelling, Programming and Computer Software
Computational TheorySimulationComputational MathematicsMathematicsModelingSoftware
2018English

An Efficient Trust Region Method for Unconstrained Discrete-Time Optimal Control Problems

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy