7380 search results - page 272 / 1476 » time 2008 |
147
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lov
181
click to vote
EOR
2008
15 years 6 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
183
click to vote
AICCSA
2008
IEEE
15 years 8 months ago
2008
IEEE
The paper presents a novel approach to increase the performance and/or throughput of iterative belief propagation (BP) decoding of low density parity check (LDPC) codes. The propo...
135
click to vote
TPDS
2008
15 years 6 months ago
2008
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...
170
click to vote
COMCOM
2002
15 years 6 months ago
2002
This paper studies the transmission control protocol (TCP) performance over a discrete multi-tone (DMT) based asymmetric digital subscriber loop (ADSL) network. The impact of DMT ...