Sciweavers

3497 search results - page 84 / 700
» Making Distributed Applications Robust
Sort
View
IJRR
2008
92views more  IJRR 2008»
15 years 4 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...
CCR
2005
97views more  CCR 2005»
15 years 4 months ago
On the robustness of router-based denial-of-service (DoS) defense systems
This paper focuses on "router-based" defense mechanisms, and whether they can provide effective solutions to network Denialof-Service (DoS) attacks. Router-based defense...
Ying Xu, Roch Guérin
SIGIR
2011
ACM
14 years 7 months ago
A boosting approach to improving pseudo-relevance feedback
Pseudo-relevance feedback has proven effective for improving the average retrieval performance. Unfortunately, many experiments have shown that although pseudo-relevance feedback...
Yuanhua Lv, ChengXiang Zhai, Wan Chen
EUROSYS
2007
ACM
16 years 1 months ago
Dryad: distributed data-parallel programs from sequential building blocks
Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines computational “vertices” with communication ...
Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrel...
ATAL
2007
Springer
15 years 10 months ago
On the robustness of preference aggregation in noisy environments
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...
Ariel D. Procaccia, Jeffrey S. Rosenschein, Gal A....