85 search results - page 11 / 17 » A Framework for Dynamic Byzantine Storage |
92
Voted
MVA
2008
14 years 11 months ago
2008
In this paper, we propose a framework that can efficiently combine features for robust tracking based on fusing the outputs of multiple spatiogram trackers. This is achieved withou...
WWW
2004
ACM
16 years 10 days ago
2004
ACM
A scalable approach to trust negotiation is required in Web service environments that have large and dynamic requester populations. We introduce Trust-Serv, a model-driven trust n...
96
Voted
TASE
2008
IEEE
14 years 11 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
95
Voted
PVLDB
2008
14 years 11 months ago
2008
Many applications rely heavily on large amounts of data in the distributed storages collected over time or produced by large scale scientific experiments or simulations. The key co...
104
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...