575 search results - page 36 / 115 » Computing Maximum Subsequence in Parallel |
HPDC
1999
IEEE
13 years 12 months ago
1999
IEEE
This paper reports on the architecture and design of Starfish, an environment for executing dynamic (and static) MPI-2 programs on a cluster of workstations. Starfish is unique in ...
PPSN
1994
Springer
13 years 11 months ago
1994
Springer
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
INTERSPEECH
2010
13 years 2 months ago
2010
This paper investigates the combination of discriminative adaptation techniques. The discriminative Maximum A-Posteriori (DMAP) adaptation and discriminative feature Maximum Likel...
ISVLSI
2002
IEEE
14 years 16 days ago
2002
IEEE
Modular inverse computation is needed in several public key cryptographic applications. In this work, we present two VLSI hardware implementations used in the calculation of Montg...