We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
—Popular Internet services are hosted by multiple geographically distributed datacenters. The location of the datacenters has a direct impact on the services’ response times, c...
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
In this work we study approximation of fuzzy functions on a finite set of distinct points. Two types of approximation are considered, one method based on fuzzy linear programming p...