Analysis and Possibility of Modification of Available Algorithms for Finding the Optimal Path on a Square Grid Using Parallel Programming Methods

Actual problems of automation and information technology
doi 10.15421/431809
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Oles Honchar Dnipropetrovsk National University

Related search

Optimal Parallel Algorithms for Finding Proximate Points, With Applications

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

Asynchronous Analysis of Parallel Dynamic Programming Algorithms

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

Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values

Journal of Algorithms
1993English

A Programming Environment for Parallel Vision Algorithms

1988English

Optimal Pebbling Number of the Square Grid

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2020English

New Textbooks on Parallel Architectures, Algorithms and Programming

2015English

Scalable Parallel Algorithms for Dynamic Programming on Tree Decomposition

English

Parallel Algorithms for Simulation and Optimization of On-Chip Power Grid Networks

English

Commentary—The Role of Performance Metrics for Parallel Mathematical Programming Algorithms

ORSA Journal on Computing
1993English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy