2924 search results - page 268 / 585 » Lower Bounds in Distributed Computing |
136
click to vote
SIROCCO
2003
15 years 5 months ago
2003
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
152
click to vote
FIDJI
2003
Springer
15 years 9 months ago
2003
Springer
— We present techniques for analyzing the source code of distributed Java applications, and building finite models of their behaviour. The models are labelled transition systems...
113
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
142
click to vote
ISIPTA
2005
IEEE
15 years 9 months ago
2005
IEEE
Uncertainty is a key issue in decision analysis and other kinds of applications. Researchers have developed a number of approaches to address computations on uncertain quantities....
138
click to vote
ICECCS
2010
IEEE
15 years 4 months ago
2010
IEEE
—In the field of distributed computing, there are many round-based algorithms to solve fundamental problems, such as leader election and distributed consensus. Due to the nature...