Sciweavers

414 search results - page 13 / 83
» A parallel extended GCD algorithm
Sort
View
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 7 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
IPPS
1999
IEEE
14 years 2 hour ago
A Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem
Abstract. This paper presents a Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem PVRP. The PRVP generalizes the classical Vehicle Routing Problem b...
Dalessandro Soares Vianna, Luiz Satoru Ochi, L&uac...
ACL
1998
13 years 9 months ago
A Simple Hybrid Aligner for Generating Lexical Correspondences in Parallel Texts
We present an algorithm for bilingual word alignment that extends previous work by treating multi-word candidates on a par with single words, and combining some simple assumptions...
Lars Ahrenberg, Mikael Andersson, Magnus Merkel
EUROPAR
2004
Springer
14 years 1 months ago
From Heterogeneous Task Scheduling to Heterogeneous Mixed Parallel Scheduling
Abstract. Mixed-parallelism, the combination of data- and taskparallelism, is a powerful way of increasing the scalability of entire classes of parallel applications on platforms c...
Frédéric Suter, Frederic Desprez, He...
HPCC
2011
Springer
12 years 7 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé