Sciweavers

108 search results - page 5 / 22
» Approximate Synchrony: An Abstraction for Distributed Almost...
Sort
View
ENTCS
2008
146views more  ENTCS 2008»
14 years 9 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
OPODIS
2003
14 years 11 months ago
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
Dariusz R. Kowalski, Mariam Momenzadeh, Alexander ...
75
Voted
CDC
2009
IEEE
15 years 2 months ago
Dynamic practical stabilization of sampled-data linear distributed parameter systems
Abstract— In this paper, dynamic practical stability properties of infinite-dimensional sampled-data systems are discussed. A family of finite-dimensional discrete-time control...
Ying Tan, Emmanuel Trélat, Yacine Chitour, ...
GLOBECOM
2008
IEEE
15 years 4 months ago
Near-Optimum Power Allocation for Outage Restricted Distributed MIMO Multi-Hop Networks
Abstract—The throughput of multi-hop communication systems can significantly be increased by the application of MIMO concepts. To utilize the physical resources in an efficient...
Dirk Wübben, Yidong Lang
SSS
2009
Springer
15 years 4 months ago
Stability of Distributed Algorithms in the Face of Incessant Faults
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...
Robert E. Lee DeVille, Sayan Mitra