We consider discounted Markov decision processes (MDPs) with countably-infinite state spaces, finite action spaces, and unbounded rewards. Typical examples of such MDPs are inventory management and ...

Abstract: The shuffled frog leaping algorithm is easily sunk into local optimum and not enough accurate when optimizing the problem of some higher dimensional functions. In view of these shortcomings, ...

Your Artstor image groups were copied to Workspace. The Artstor website will be retired on Aug 1st. Science Progress (1933-) Vol. 103, No. 4, 2020 A new method for ...

Abstract: In the large-scale industrial processes, there are more slow perturbations. So the mathematical model of an actual system is difficult to be accurate. When optimizing large-scale industrial ...

This project demonstrates how to model and solve "project phased implementation" as a Linear Programming (LP) problem using the Simplex Method/Algorithm, which is a powerful technique for solving ...

New hifiasm-ONT assembly method delivers high-quality, cost-efficient near T2T assemblies using standard Oxford Nanopore Simplex reads, broadening access to comprehensive genome assemblies across ...

ABSTRACT: Genetic algorithms have been extensively used as a global optimization tool. These algorithms, however, suffer from their generally slow convergence rates. This paper proposes two approaches ...

While sitting in a courtroom, waiting to find out if he would be chosen for jury duty, Daniel Spielman had a revelation-all the work he and colleague Shanghua Teng had built up over the past three ...