JSTOR Daily

The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem

In metamodeling, the choice of sampling points is crucial for the quality of the model. In this context, the maximin Latin hypercube designs (LHD), with their space-filling and noncollapsing ...
JSTOR Daily

An Approximation Algorithm for the Bipartite Traveling Tournament Problem

The bipartite traveling tournament problem (BTTP) is an NP-complete scheduling problem whose solution is a double round-robin inter-league tournament with minimum total travel distance. The 2n-team ...
Queen Mary University of London

A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries

Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association for Computing Machinery (ACM) Test of Time Award at a virtual ceremony on Wednesday 23 June at the ...
IEEE

A double-linear approximation algorithm to achieve maximum-power-point tracking for PV arrays

Abstract: In this paper, a double-linear approximation algorithm (DLAA) to achieve maximum-power-point tracking (MPPT) for PV arrays is proposed. The DLAA is based on that the trajectories of maximum ...
IEEE

An Actor-Critic Algorithm with Function Approximation for Risk Sensitive Cost Markov Decision Processes

Abstract: In this paper, we consider the risk-sensitive cost criterion with exponentiated costs for Markov decision processes and develop a model-free policy gradient algorithm in this setting. Unlike ...