Optimistic replication is often viewed as essential for large scale systems and for supporting mobile computing. In optimistic replication, updates can be made concurrently to diierent le replicas, resulting in multiple versions of the le. To recover from these connicting updates, after-the fact connict resolution actions are required to recombine multiple versions into one. This paper deenes t...

We consider extending the AIXI agent by using multiple (or even a compact class of) priors. This has the benefit of weakening the conditions on the true environment that we need to prove asymptotic optimality. Furthermore, it decreases the arbitrariness of picking the prior or reference machine. We connect this to removing symmetry between accepting and rejecting bets in the rationality axiomat...

In this position paper we describe an interface to incorporate application-specific knowledge for conflict resolution in an optimistically replicated file system. Conflicts arise in such systems because replicas of an object can be modified simultaneously in different network partitions. Application-specific knowledge is made available by the application writer in specialized tools called Appli...

Optimism is a well-known technique to enhance the performance of distributed protocols. Optimistic approaches exploit properties exhibited by the system with certain likelihood, (i.e., that certain kinds of scenarios will prevail over others) to outperform the corresponding conservative protocol. These properties are usually referred as optimistic assumptions (e.g., an optimistic assumption is ...

    In this paper, a new revenue efficiency data envelopment analysis (RE-DEA) approach is considered for finding the most revenue efficient unit with price uncertainty in both optimistic and pessimistic perspectives. The optimistic and pessimistic perspectives use efficient frontier and inefficient frontier, respectively. An integrated model is introduced to find decision making units (DMUs) t...