2474 search results - page 394 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
134
click to vote
PODC
2004
ACM
15 years 10 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...
183
click to vote
PPOPP
2006
ACM
15 years 10 months ago
2006
ACM
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
143
click to vote
PODC
1999
ACM
15 years 9 months ago
1999
ACM
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
148
click to vote
WABI
2005
Springer
15 years 10 months ago
2005
Springer
In contrast to proteins, many classes of functionally related RNA molecules show a rather weak sequence conservation but instead a fairly well conserved secondary structure. Hence ...
163
click to vote
GCB
2009
Springer
15 years 11 months ago
2009
Springer
: Solving problems in bioinformatics often needs extensive computational power. Current trends in processor architecture, especially massive multi-core processors for graphic cards...