5005 search results - page 208 / 1001 » The Design and Analysis of Parallel Algorithms |
125
Voted
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
125
Voted
PDCAT
2005
Springer
15 years 9 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
105
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
141
Voted
PODC
2006
ACM
15 years 9 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
117
Voted
VLSID
2005
IEEE
15 years 9 months ago
2005
IEEE
Microfluidics-based biochips offer a promising platform for massively parallel DNA analysis, automated drug discovery, and real-time biomolecular recognition. The first part of th...