Sciweavers

3208 search results - page 147 / 642
» A Lower Bound for Primality
Sort
View
PODC
1991
ACM
15 years 10 months ago
Resource Bounds for Self Stabilizing Message Driven Protocols
Abstract. Self-stabilizing message driven protocols are defined and discussed. The class weakexclusion that contains many natural tasks such as -exclusion and token-passing is de...
Shlomi Dolev, Amos Israeli, Shlomo Moran
WDAG
2007
Springer
82views Algorithms» more  WDAG 2007»
16 years 17 days ago
The Space Complexity of Unbounded Timestamps
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Faith Ellen, Panagiota Fatourou, Eric Ruppert
STOC
1997
ACM
76views Algorithms» more  STOC 1997»
15 years 10 months ago
Exploring Unknown Environments
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
Susanne Albers, Monika Rauch Henzinger
PIMRC
2010
IEEE
15 years 4 months ago
Tightness of capacity bounds in correlated MIMO systems with channel estimation error
We consider a point-to-point, correlated and block fading multiple antenna channel where the receiver has a noisy channel estimation and the transmitter has the statistics of the c...
Alkan Soysal
GLOBECOM
2008
IEEE
16 years 27 days ago
Tight Bounds of the Generalized Marcum Q-Function Based on Log-Concavity
—In this paper, we manage to prove the log-concavity of the generalized Marcum Q-function Qν (a, b) with respect to its order ν on [1, ∞). The proof relies on a powerful math...
Yin Sun, Shidong Zhou