Sciweavers

14699 search results - page 285 / 2940
» Complexity and Cognitive Computing
Sort
View
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
15 years 2 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik
TCOM
2008
127views more  TCOM 2008»
15 years 4 months ago
Low complexity affine MMSE detector for iterative detection-decoding MIMO OFDM systems
Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum frontend detecti...
Daniel N. Liu, Michael P. Fitz
PODC
2012
ACM
13 years 6 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
ICALP
2009
Springer
16 years 4 months ago
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
Michael Ummels, Dominik Wojtczak
CASC
2009
Springer
157views Mathematics» more  CASC 2009»
15 years 10 months ago
On the Complexity of Reliable Root Approximation
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
Michael Kerber