572 search results - page 71 / 115 » Exponential-Time Approximation of Hard Problems |
128
Voted
SIGECOM
2008
ACM
15 years 2 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
144
Voted
TEC
2010
14 years 9 months ago
2010
-- We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-)...
123
Voted
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
The Relevance Vector Machine (RVM) is a sparse approximate Bayesian kernel method. It provides full predictive distributions for test cases. However, the predictive uncertainties ...
97
Voted
STACS
2004
Springer
15 years 8 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
122
Voted
JCO
1998
15 years 2 months ago
1998
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...