5580 search results - page 63 / 1116 » Randomized priority algorithms |
FOCS
2010
IEEE
14 years 7 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,...
MSWIM
2005
ACM
15 years 3 months ago
2005
ACM
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...
AE
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Markov Random Fields (MRFs) 5] are a class of probabalistic models that have been applied for many years to the analysis of visual patterns or textures. In this paper, ou...
102
click to vote
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— We consider a joint randomized scheduling, congestion control mechanism for general wireless networks. We allow for a set of imperfections in the operation of the rando...
FOCS
1994
IEEE
15 years 1 months ago
1994
IEEE
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...