3862 search results - page 735 / 773 » Adaptive Noisy Optimization |
146
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
229
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
251
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
233
click to vote
SIGMOD
2008
ACM
16 years 5 months ago
2008
ACM
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
172
click to vote
MOBIHOC
2007
ACM
16 years 5 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...