The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)...
With the near ubiquity of mobile phones, people are reachable almost anywhere and at any time. At the same time we see an increasing need for people to limit their interactions on...
Ibrahim Bokharouss, Wayne Wobcke, Yiu-Wa Chan, And...
Abstract. This paper presents the mathematical framework, and develops algorithms accordingly, to continuously and robustly track the intersection curves of two deforming parametri...
Xianming Chen, Richard F. Riesenfeld, Elaine Cohen...
In recent software transactional memory proposals, a contention manager module is responsible for ensuring that the system as a whole makes progress. A number of contention manage...
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...