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

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

The dynamic equivalence problem illustrates trade-offs that we often see when designing algorithms. There are two operations we’d like to perform, find and union, and we can optimize either to have ...

Wim P. M. Vijverberg, Discrete Choices in Continuous Time as a Dynamic Programming Problem, The American Economist, Vol. 28, No. 2 (Fall, 1984), pp. 9-17 ...

A palindrome is a nonempty string over some alphabet that reads the same forward and backward. Examples of palindromes are all strings of length 1, civic, racecar, and aibohphobia (fear of palindromes ...

There are wide arrays of discrete resource allocation problems (buffers in manufacturing, complex equipment in electric power, aircraft and locomotives in transportation) which need to be solved over ...

Create divide and conquer, dynamic programming, and greedy algorithms. Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems.