Sciweavers

800 search results - page 24 / 160
» On the Complexity of Parity Games
Sort
View
CORR
2008
Springer
159views Education» more  CORR 2008»
13 years 9 months ago
Stochastic Limit-Average Games are in EXPTIME
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...
Krishnendu Chatterjee, Rupak Majumdar, Thomas A. H...
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
VLSID
2005
IEEE
100views VLSI» more  VLSID 2005»
14 years 10 months ago
Implementing LDPC Decoding on Network-on-Chip
Low-Density Parity Check codes are a form of Error Correcting Codes used in various wireless communication applications and in disk drives. While LDPC codes are desirable due to t...
Theo Theocharides, Greg M. Link, Narayanan Vijaykr...
FOCS
2008
IEEE
14 years 4 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
ISCA
2002
IEEE
115views Hardware» more  ISCA 2002»
14 years 2 months ago
ReVive: Cost-Effective Architectural Support for Rollback Recovery in Shared-Memory Multiprocessors
This paper presents ReVive, a novel general-purpose rollback recovery mechanism for shared-memory multiprocessors. ReVive carefully balances the conflicting requirements of avail...
Milos Prvulovic, Josep Torrellas, Zheng Zhang