Sciweavers

874 search results - page 62 / 175
» Practical Algorithms for Selection on Coarse-Grained Paralle...
Sort
View
ISSAC
2009
Springer
155views Mathematics» more  ISSAC 2009»
14 years 4 months ago
Parallel sparse polynomial multiplication using heaps
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
Michael B. Monagan, Roman Pearce
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
14 years 3 months ago
A hybrid evolutionary algorithm for the p-median problem
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
István Borgulya
SOSP
1997
ACM
13 years 11 months ago
Automated Hoarding for Mobile Computers
A common problem facing mobile computing is disconnected operation, or computing in the absence of a network. Hoarding eases disconnected operation by selecting a subset of the us...
Geoffrey H. Kuenning, Gerald J. Popek
IPPS
2009
IEEE
14 years 4 months ago
Dynamic parallelization for RNA structure comparison
In this paper we describe the parallelization of a dynamic programming algorithm used to find common RNA secondary structures including pseudoknots and similar structures. The se...
Eric Snow, Eric Aubanel, Patricia Evans
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
14 years 3 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...