2924 search results - page 349 / 585 » Lower Bounds in Distributed Computing |
136
click to vote
ISPDC
2008
IEEE
15 years 11 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
137
click to vote
STACS
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
164
click to vote
JCS
2008
15 years 4 months ago
2008
Randomized protocols for hiding private information can be regarded as noisy channels in the information-theoretic sense, and the inference of the concealed information can be reg...
170
click to vote
PDCAT
2007
Springer
15 years 10 months ago
2007
Springer
—Grid system software is inherently complex, hard to build and maintain. In this paper, we propose a selfmanaging building block: Grid Unit, which facilitates constructing Grid s...
136
click to vote
HPDC
2006
IEEE
15 years 10 months ago
2006
IEEE
— The potential of truly large scale grids can only be realized with grid architectures and deployment strategies that lower the need for human administrative intervention, and t...