Sciweavers

29908 search results - page 172 / 5982
» On the Complexity of
Sort
View
TSP
2008
86views more  TSP 2008»
15 years 6 months ago
Fixed-Complexity Soft MIMO Detection via Partial Marginalization
Abstract--This paper presents a new approach to soft demodulation for MIMO channels. The proposed method is an approximation to the exact a posteriori probability-per-bit computer....
Erik G. Larsson, Joakim Jalden
TSP
2008
147views more  TSP 2008»
15 years 6 months ago
Low-Complexity MIMO Multiuser Receiver: A Joint Antenna Detection Scheme for Time-Varying Channels
Abstract--This paper deals with the uplink of a wireless multiple-input multiple-output (MIMO) communication system based on multicarrier (MC) code division multiple access (CDMA)....
Charlotte Dumard, Thomas Zemen
CORR
2002
Springer
93views Education» more  CORR 2002»
15 years 6 months ago
Modeling Complex Domains of Actions and Change
This paper studies the problem of modeling complex domains of actions and change within highlevel action description languages. We investigate two main issues of concern: (a) can ...
Antonis C. Kakas, Loizos Michael
CORR
1998
Springer
135views Education» more  CORR 1998»
15 years 6 months ago
The Computational Complexity of Probabilistic Planning
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
APAL
1999
120views more  APAL 1999»
15 years 6 months ago
Bounded Arithmetic, Proof Complexity and Two Papers of Parikh
This article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh's papers on these subjects and s...
Samuel R. Buss