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

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 ...

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 ...

Warranty : This software is provided "as is" without any warranty; without even the implied warranty of merchantability or fitness for a particular purpose. A handy guide of sorts for any computer ...

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 ...

Unlock the full InfoQ experience by logging in! Stay updated with your favorite authors and topics, engage with content, and download exclusive resources. Dany Lepage discusses the architectural ...

There are varieties of embedded systems in the world, it’s a big challenge to optimized the instruction sets of SoCs according to different systems’ working environments. The idea of dynamic ...