2474 search results - page 465 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
SKG
2006
IEEE
14 years 2 months ago
2006
IEEE
Web services (WS) have become a significant part of the Web because of such attractive features as simple to use, platform independence, and XML/SOAP support. However, these featu...
SPAA
2004
ACM
14 years 2 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
ICDCN
2011
Springer
13 years 7 days ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considerin...
BIBE
2008
IEEE
14 years 3 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...