12659 search results - page 267 / 2532 » The distributed breakout algorithms |
162
click to vote
IPPS
2003
IEEE
16 years 1 days ago
2003
IEEE
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
180
click to vote
PDP
2003
IEEE
16 years 23 hour ago
2003
IEEE
The paper presents a Coarse-Grained Multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with È processors in ...
164
click to vote
CLADE
2003
IEEE
16 years 1 days ago
2003
IEEE
The heterogeneity and unpredictability of grid computing environments is a severe challenge to algorithm selection for large-scale scientific codes. This paper discusses a set of ...
158
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
171
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violatin...