399 search results - page 42 / 80 » Parallel evolutionary algorithms can achieve super-linear pe... |
PODC
2004
ACM
14 years 1 months ago
2004
ACM
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
ARC
2012
Springer
12 years 3 months ago
2012
Springer
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
VLSID
2006
IEEE
14 years 1 months ago
2006
IEEE
Low density parity check (LDPC) codes are one of the most powerful error correcting codes known. Recent research have pointed out their potential for a low cost, low latency hardw...
ICDCN
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. The availability of multiple orthogonal channels in a wireless network can lead to substantial performance improvement by alleviating contention and interference. However...
JUCS
2008
13 years 7 months ago
2008
: Nowadays, while large-sized multimedia objects are becoming very popular throughout the Internet, one of the important issues appears to be the acceleration of content delivery n...