3875 search results - page 46 / 775 » Approximation Algorithms for the Max-coloring Problem |
DCG
2000
13 years 8 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
TOMACS
2010
13 years 3 months ago
2010
In this paper, we develop a stochastic approximation method to solve a monotone estimation problem and use this method to enhance the empirical performance of the Q-learning algor...
TON
2010
13 years 3 months ago
2010
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
ALGORITHMICA
2005
13 years 8 months ago
2005
Abstract. We consider the problem of approximating a polygonal curve