837 search results - page 84 / 168 » Distributed algorithms for reaching consensus on general fun... |
PLDI
2012
ACM
11 years 11 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
STACS
2000
Springer
14 years 23 days ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
The instruction sets of general-purpose microprocessors are designed to offer good performance across a wide range of programs. The size and complexity of the instruction sets, how...
ICPR
2010
IEEE
14 years 15 days ago
2010
IEEE
Abstract--This paper extends the transition method for binarization based on transition pixels, a generalization of edge pixels. This method originally computes transition threshol...
FSTTCS
2004
Springer
14 years 2 months ago
2004
Springer
A self-stabilizing distributed protocol can recover from any state-corrupting fault. A self-stabilizing protocol is called adaptive if its recovery time is proportional to the numb...