Sciweavers

74 search results - page 10 / 15
» Property Testing Lower Bounds via Communication Complexity
Sort
View
TC
2002
13 years 7 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
14 years 6 days ago
Robust stabilization of model-based uncertain singularly perturbed systems with networked time-delay
—In this paper, a robust stabilization of the uncertain singularly perturbed system via a networked state feedback with the transmission time-delay is addressed. Taking its nomin...
Zhiming Wang, Wei Liu, Haohui Dai, D. Subbaram Nai...
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 7 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
SPAA
2009
ACM
14 years 2 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
CDC
2009
IEEE
144views Control Systems» more  CDC 2009»
13 years 11 months ago
Stochastic control over finite capacity channels: Causality, feedback and uncertainty
Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...
Charalambos D. Charalambous, Christos K. Kourtella...