Sciweavers

2519 search results - page 54 / 504
» Martingales and Locality in Distributed Computing
Sort
View
EUROPAR
2007
Springer
14 years 2 months ago
Locality Optimized Shared-Memory Implementations of Iterated Runge-Kutta Methods
Iterated Runge-Kutta (IRK) methods are a class of explicit solution methods for initial value problems of ordinary differential equations (ODEs) which possess a considerable poten...
Matthias Korch, Thomas Rauber
ATAL
2007
Springer
14 years 2 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee
PODC
2011
ACM
12 years 11 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela
GREC
2009
Springer
13 years 12 months ago
A Performance Characterization Algorithm for Symbol Localization
In this paper we present an algorithm for performance characterization of symbol localization systems. This algorithm is aimed to be a more “reliable” and “open” solution t...
Mathieu Delalandre, Jean-Yves Ramel, Ernest Valven...
DCOSS
2006
Springer
14 years 12 days ago
Distributed User Access Control in Sensor Networks
User access control in sensor networks defines a process of granting user the access right to the information and resources. It is essential for the future real sensor network depl...
Haodong Wang, Qun Li