2421 search results - page 183 / 485 » Approximate Flow-Aware Networking |
170
Voted
EMNLP
2006
15 years 4 months ago
2006
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
140
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...
141
Voted
JUCS
2010
14 years 10 months ago
2010
: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet e...
118
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
176
Voted
TKDE
2012
13 years 6 months ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...