10608 search results - page 544 / 2122 » Complexity of O'Hara's Algorithm |
192
Voted
TEC
2008
15 years 7 months ago
2008
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
193
Voted
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
The problem of interference alignment in time-varying MIMO interference channels is considered. To reduce complexity, an adaptive algorithm for beam vector design is proposed base...
157
Voted
VTC
2010
IEEE
15 years 5 months ago
2010
IEEE
— In this work, we proposed a reliability-based enhancement for the Viterbi and the optimal decoding of the convolutional tailbiting codes (CTBC) from the observations that the d...
205
click to vote
IPL
2011
14 years 10 months ago
2011
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
160
Voted
ITNG
2007
IEEE
16 years 1 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...