2084 search results - page 372 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
101
click to vote
SP
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
84
Voted
DAM
2007
14 years 9 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
ISQED
2006
IEEE
15 years 3 months ago
2006
IEEE
Process variation has become a major concern in the design of many nanometer circuits, including interconnect pipelines. This paper develops closed-form models to predict the dela...
PDCAT
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we propose a novel active queue management (AQM) scheme based on the Random Early Detection (RED) of the loss ratio and the total sending rate control, called LRC-R...
165
click to vote
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...