Description: Finds the contiguous subarray with the maximum sum in an array containing both positive and negative integers Key Concepts: Dynamic programming, optimal substructure ...

This work presents GenDP, a programmable dynamic programming acceleration framework that supports general-purpose acceleration for genomics kernels in commonly used sequencing pipelines.

The purpose of this note is to extend the Approximate Dynamic Programming (ADP) method to the infinite time stochastic optimal control (ergodic) problem. It is also shown that a modification of the ...

Subsequently, a real-time cooperative voltage regulation strategy based on approximate dynamic programming is proposed, which employs segmented linear functions to process the value function to reduce ...

Accelerated Point-Wise Maximum Approach to Approximate Dynamic Programming Abstract: In this article, we describe an approximate dynamic programming (ADP) approach to compute lower bounds on the ...