1279 search results - page 68 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
133
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
158
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
113
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
179
click to vote
FOGA
2011
14 years 8 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
151
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...