12519 search results - page 6 / 2504 » Approximation Problems Categories |
STOC
2010
ACM
14 years 3 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
TALG
2010
13 years 9 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
The role of space is more and more accepted as a way to dramatically improve the success of coevolutionary function approximation. The process behind this success however is not y...
AAMAS
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
STOC
2005
ACM
14 years 11 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...