572 search results - page 40 / 115 » Exponential-Time Approximation of Hard Problems |
137
click to vote
FOCS
2009
IEEE
16 years 22 days ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
192
click to vote
SOFSEM
2007
Springer
16 years 2 days ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
138
click to vote
SIGECOM
2005
ACM
15 years 11 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
311
click to vote
IACR
2011
14 years 5 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
164
click to vote
IPSN
2009
Springer
16 years 23 days ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...