In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Background: We establish that the occurrence of protein folds among genomes can be accurately described with a Weibull function. Systems which exhibit Weibull character can be int...
Artem Cherkasov, Shannan J. Ho Sui, Robert C. Brun...
In this paper the Archimedean property and the nilpotency of t-norms on the lattice LI is investigated, where LI is the underlying lattice of interval-valued fuzzy set theory (Sam...
This paper presents a theory of testing for processes calculi which have broadcast as basic communication primitive. Firstly, we justify the necessity of an alternative theory to b...