Results 231 to 240 of about 740,083 (279)
Pipeline Olympics: continuable benchmarking of computational workflows for DNA methylation sequencing data against an experimental gold standard. [PDF]
Lin YY +39 more
europepmc +1 more source
Perioperative management protocol for abdominal wall hernia repair in a public reference healthcare unit in Amazonas - Brazil. [PDF]
Souza TGM +3 more
europepmc +1 more source
Blockchain Technology for Big-data Sharing in Material Genome Engineering. [PDF]
Wang R +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83, 1983
A consensus protocol enables a system of n asynchronous processes, some of which are faulty, to reach agreement. There are two kinds of faulty processes: fail-stop processes can only die, malicious processes can also send false messages. We investigate consensus protocols that terminate within finite time with probability 1 under certain assumptions on
Gabriel Bracha, Sam Toueg
openaire +1 more source
A consensus protocol enables a system of n asynchronous processes, some of which are faulty, to reach agreement. There are two kinds of faulty processes: fail-stop processes can only die, malicious processes can also send false messages. We investigate consensus protocols that terminate within finite time with probability 1 under certain assumptions on
Gabriel Bracha, Sam Toueg
openaire +1 more source
Decentralized consensus protocols
[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications, 2002The goal of decentralized consensus protocols is to exchange information among computers so that each computer acquires information held by every other computer in the system. The authors introduce a unifying framework which generalizes these decentralized consensus protocols.
M.L. Neilsen, M. Mizuno
openaire +1 more source
Efficient decentralized consensus protocols
IEEE Transactions on Software Engineering, 1986Decentralized consensus protocols are characterized by successive rounds of message interchanges. Protocols which achieve a consensus in one round of message interchange require O(N2) messages, where N is the number of participants. A communication scheme based on finite projective planes is presented which requires only O(N√N) messages for each round.
T. V. Lakshman, Ashok K. Agrawala
openaire +1 more source
Journal of Economic Theory, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

