We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the Subspace Projection (SP) algorithm by ...
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
Abstract. The Operational Transformation (OT) approach is a technique for supporting optimistic replication in collaborative and mobile systems. It allows the users to concurrently...
In this paper we present a method of parameter optimization, relative trust-region learning, where the trust-region method and the relative optimization [21] are jointly exploited...