Dynamic programming algorithms are a good place to start understanding what's really going on inside computational biology software. The heart of many well-known programs is a dynamic programming ...

We present an Approximate Dynamic Programming (ADP) approach for the multidimensional knapsack problem (MKP). We approximate the value function (a) using parametric and nonparametric methods and (b) ...

In a companion paper (Godfrey and Powell 2002) we introduced an adaptive dynamic programming algorithm for stochastic dynamic resource allocation problems, which arise in the context of logistics and ...

In addition to other methods we’ve discussed, a third type of variable spending model uses dynamic programming methods. These methods rely on complex computing power and mathematical equations to ...

Mathematical Background: We expect that the student is comfortable with basic mathematics at the level of a U.S. first-year college STEM student. This includes basic notions such as sets and functions ...

Abstract: This paper investigates a dynamic slab design problem in the steel industry, where order demands arrive dynamically during a given period. Slabs are the raw materials for producing order ...

A novel two-stage Track-Before-Detect (TbD) method has been developed to significantly improve the detection of weak moving targets using reflected Global Navigation Satellite System (GNSS) signals.