575 search results - page 49 / 115 » Computing Maximum Subsequence in Parallel |
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
We develop a message scheduling scheme that can theoretically achieve the maximum throughput for all–to–all personalized communication (AAPC) on any given Ethernet switched cl...
ISPAN
2005
IEEE
14 years 1 months ago
2005
IEEE
Most high-end switches use an input-queued or a combined input- and output-queued architecture. The switch fabrics of these architectures commonly use an iterative scheduling syst...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
— We consider the problem of reliable broadcast in an infinite grid (or finite toroidal) radio network under Byzantine and crash-stop failures. We present bounds on the maximum...
PDCAT
2005
Springer
14 years 1 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
IPPS
2000
IEEE
14 years 1 days ago
2000
IEEE
This paper presents a family of simulators that have been developed for data-intensive applications, and a methodology to select the most efficient one based on a usersupplied req...