Sciweavers

2485 search results - page 328 / 497
» Time Bounded Frequency Computations
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
A Counterexample to Strong Parallel Repetition
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)...
Ran Raz
AINA
2007
IEEE
14 years 2 months ago
A Location-Aware Mobile Call Handling Assistant
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...
GMP
2006
IEEE
137views Solid Modeling» more  GMP 2006»
14 years 2 months ago
Theoretically Based Robust Algorithms for Tracking Intersection Curves of Two Deforming Parametric Surfaces
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...
PODC
2005
ACM
14 years 1 months ago
Toward a theory of transactional contention managers
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...
Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
DALT
2005
Springer
14 years 1 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
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...
Thomas Ågotnes, Michal Walicki