1982 search results - page 314 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
136
click to vote
EOR
2010
15 years 2 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
145
Voted
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Behavioral targeting (BT) leverages historical user behavior to select the ads most relevant to users to display. The state-of-the-art of BT derives a linear Poisson regression mo...
148
Voted
CONEXT
2009
ACM
15 years 3 months ago
2009
ACM
: We study mobile P2P content dissemination schemes which leverage the local dedicated caches provided by hand-held devices (e.g., smart-phones, PDAs) and opportunistic contacts be...
134
Voted
MOBIHOC
2002
ACM
16 years 2 months ago
2002
ACM
We examine two aspects concerning the influence of unidirectional links on routing performance in multihop wireless networks. In the first part of the paper, we evaluate the benef...
144
Voted
DC
2010
14 years 11 months ago
2010
In this paper, we present RAMBO, an algorithm for emulating a read/write distributed shared memory in a dynamic, rapidly changing environment. RAMBO provides a highly reliable, hi...