3894 search results - page 97 / 779 » Approximation Algorithms for Biclustering Problems |
171
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
168
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
160
click to vote
DISOPT
2008
15 years 6 months ago
2008
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
155
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
164
click to vote
AAAI
2010
15 years 6 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...