3875 search results - page 128 / 775 » Approximation algorithms for the 0-extension problem |
142
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
129
click to vote
ADHOC
2010
15 years 4 months ago
2010
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
174
click to vote
PODS
2012
ACM
13 years 7 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...
127
click to vote
ICAI
2009
15 years 2 months ago
2009
- We address the issues of improving the feature generation methods for the value-function approximation and the state space approximation. We focus the improvement of feature gene...
138
click to vote
TALG
2010
15 years 2 months ago
2010
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...