1449 search results - page 111 / 290 » Self-Randomized Exponentiation Algorithms |
164
click to vote
CEC
2008
IEEE
16 years 24 days ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
151
click to vote
ICC
2007
IEEE
16 years 19 days ago
2007
IEEE
—The full-complexity soft-input/soft-output (SISO) multiuser detector based on the a posteriori probability (APP) algorithm has a computational complexity growing exponentially w...
160
click to vote
MFCS
2007
Springer
16 years 13 days ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
157
click to vote
ASPDAC
2004
ACM
15 years 11 months ago
2004
ACM
With the exponential reduction in the scaling of feature size, inter-wire coupling capacitance becomes the dominant part of load capacitance. Two problems are introduced by coupli...
155
click to vote
VTC
2008
IEEE
16 years 20 days ago
2008
IEEE
Abstract—In this paper we present reduced-complexity highperformance receivers for single-user MIMO systems that employ coded OFDM transmission with bit-interleaved coded modulat...