The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
In this paper we analyze the Ricean K-factor for vehicle-to-vehicle (V2V) communications in a typical open suburban street crossing. The channel conditions vary from non line-of si...
The paper provides a compositional account of cumulative readings with non-increasing modified numerals (aka van Benthem's puzzle), e.g., Exactly three boys saw exactly five m...
In this paper we present an alternative interpretation of statements of epistemic possibility, which does not induce a consistency test on a common ground, as in (Veltman 1996), bu...