3894 search results - page 110 / 779 » Approximation Algorithms for Biclustering Problems |
206
click to vote
PODS
2012
ACM
13 years 8 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
159
click to vote
MP
1998
15 years 6 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
168
click to vote
ATAL
2007
Springer
16 years 17 days ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
185
click to vote
FSTTCS
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
156
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...