Sciweavers

1243 search results - page 218 / 249
» Complexity reduction of C-Algorithm
Sort
View
ATAL
2010
Springer
15 years 2 months ago
Optimal social laws
Social laws have proved to be a powerful and theoretically elegant framework for coordination in multi-agent systems. Most existing models of social laws assume that a designer is...
Thomas Ågotnes, Michael Wooldridge
CORR
2010
Springer
171views Education» more  CORR 2010»
15 years 1 months ago
Randomized Lattice Decoding
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
Shuiyin Liu, Cong Ling, Damien Stehlé
JAR
2006
236views more  JAR 2006»
15 years 1 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
VTC
2010
IEEE
122views Communications» more  VTC 2010»
14 years 11 months ago
Generalized MIMO Transmit Preprocessing Using Pilot Symbol Assisted Rateless Codes
In this paper, we propose a generalized multiple-input multiple-output (MIMO) transmit preprocessing system, where both the channel coding and the linear MIMO transmit precoding c...
Nicholas Bonello, Du Yang, Shen Chen, Lajos Hanzo
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
14 years 1 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin