3874 search results - page 329 / 775 » Approximation Algorithms for k-hurdle Problems |
110
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
142
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
137
Voted
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...
165
click to vote
IPCO
2007
15 years 6 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
163
Voted
ICPR
2008
IEEE
16 years 6 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...