Sciweavers

3341 search results - page 288 / 669
» On Bounded Queries and Approximation
Sort
View
155
Voted
CDC
2008
IEEE
113views Control Systems» more  CDC 2008»
16 years 1 months ago
Model reduction for a class of input-quantized systems in the max-plus algebra
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 ï¬...
Whitney Weyerman, Sean Warnick
STACS
2007
Springer
16 years 25 days ago
On Completing Latin Squares
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...
NIPS
2008
15 years 8 months ago
Regularized Policy Iteration
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...
SODA
2003
ACM
126views Algorithms» more  SODA 2003»
15 years 8 months ago
Smaller core-sets for balls
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...
Mihai Badoiu, Kenneth L. Clarkson
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 6 months ago
Local algorithms in (weakly) coloured graphs
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 ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...