Abstract— We present a systematic method for model reduction of a class of input-quantized systems in the max-plus algebra. We consider a generalization of the flow shop with ï¬...
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
Iman Hajirasouliha, Hossein Jowhari, Ravi Kumar, R...
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...