A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Agreement algorithms can be categorized in different ways. One categorization of such algorithms is based on whether the final decisions are exact or inexact. In inexact algorithms, also known as approximate agreement algorithms, each node produces its final decision that may not be necessarily the exact same decision value produced by a different non-faulty node. Most studies on such algorithms are either oblivious to the confidence level placed on each node or the impact of malicious behaviordblp:journals/ijnsec/AzadmaneshFN08 fatcat:alroimyq6netliza55jarlqxsu