Dynamic stochastic matching problems arise in a variety of recent applications, ranging from ridesharing and online video games to kidney exchange. Such problems are naturally formulated as Markov ...

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

Researchers at the Regensburg Center for Biochemistry (RCB) and the Regensburg Center for Ultrafast Nanoscopy (RUN) at the University of Regensburg are obtaining unique insights into the structure, ...

Researchers have moved beyond relying on the static information delivered by DNA sequences in the blood. Instead, they've generated a much more dynamic picture by monitoring changing levels of another ...

Wang, Franklyn, Ravi Jagadeesan, and Scott Duke Kominers. "Optimizing Reserves in School Choice: A Dynamic Programming Approach." Operations Research Letters 47, no. 5 (September 2019): 438–446.

RNA’s single-stranded nature makes it amenable to forming complicated structures through folding. Using RNA nanotechnology, a single-stranded architecture (named RNA origami) was developed that ...

Researchers have developed a fundamentally new approach to DNA data storage systems, giving users the ability to read or modify data files without destroying them and making the systems easier to ...