Abstract: In this paper, we establish error bounds of adaptive dynamic programming algorithms for solving undiscounted infinite-horizon optimal control problems of ...

This article will introduce the concepts and topics common to all programming languages that beginners and experts must know! Do you want to learn a programming language for the first time? Do you ...

The Smith-Waterman algorithm is a dynamic programming algorithm to find the optimal alignment of two sequences. This repository provides a basic implementation of the Smith-Waterman algorithm that has ...

Part of the DynGraphLab — Dynamic Graph Algorithms open source framework. Developed at the Algorithm Engineering Group, Heidelberg University. Python Interface: An easy-to-use Python interface for ...

Considering that the probability distribution of random variables in stochastic programming usually has incomplete information due to a perfect sample data in many real applications, this paper ...

Presented at the 2015 Supercomputing Conference, this paper shows that dynamic parallelism enables relatively high-performance graph algorithms for GPUs. Dynamic parallelism allows GPU kernels to ...

Abstract: In this paper, we improve the A* algorithm for computing the edit distance between rooted labeled unordered trees designed by Higuchi et al. (2012) by using the dynamic programming technique ...

ABSTRACT: A parallel version of the traditional grid based cost-to-go function generation algorithm used in robot path planning is introduced. The process takes advantage of the spatial layout of an ...