355 search results - page 32 / 71 » A New Approximation Technique for Resource-Allocation Proble... |
124
click to vote
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
156
click to vote
ICDCIT
2012
Springer
13 years 7 months ago
2012
Springer
Abstract. A key challenge in multi-robot teaming research is determining how to properly enable robots to make decisions on actions they should take to contribute to the overall sy...
107
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
121
click to vote
SIGMOD
2001
ACM
15 years 12 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....