1279 search results - page 64 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
PODC
2005
ACM
14 years 2 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
AAMAS
2007
Springer
13 years 9 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...
WAOA
2007
Springer
14 years 2 months ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...