74 search results - page 2 / 15 » How Good is Almost Perfect |
IPCO
2010
13 years 7 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
SIAMSC
2010
13 years 4 months ago
2010
In this paper, we consider cracks with Dirichlet boundary conditions. We first derive an asymptotic expansion of the boundary perturbations that are due to the presence of a smal...
EUROCRYPT
2008
Springer
13 years 7 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
CHI
2005
ACM
14 years 6 months ago
2005
ACM
In the context of an information search task, does the visual salience of items interact with information scent? That is, do things like bold headlines or highlighted phrases inte...
ISPD
2004
ACM
13 years 11 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...