Sciweavers

874 search results - page 28 / 175
» Practical Algorithms for Selection on Coarse-Grained Paralle...
Sort
View
APIN
1998
132views more  APIN 1998»
15 years 1 months ago
Evolution-Based Methods for Selecting Point Data for Object Localization: Applications to Computer-Assisted Surgery
Object localization has applications in many areas of engineering and science. The goal is to spatially locate an arbitrarily-shaped object. In many applications, it is desirable ...
Shumeet Baluja, David Simon
PPOPP
1997
ACM
15 years 5 months ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon
PPSN
1998
Springer
15 years 5 months ago
On Risky Methods for Local Selection under Noise
The choice of the selection method used in an evolutionary algorithm may have considerable impacts on the behavior of the entire algorithm. Therefore, earlier work was devoted to t...
Günter Rudolph
BMCBI
2010
190views more  BMCBI 2010»
15 years 1 months ago
A parallel and incremental algorithm for efficient unique signature discovery on DNA databases
Background: DNA signatures are distinct short nucleotide sequences that provide valuable information that is used for various purposes, such as the design of Polymerase Chain Reac...
Hsiao Ping Lee, Tzu-Fang Sheu, Chuan Yi Tang
PVM
2004
Springer
15 years 6 months ago
Neighborhood Composition: A Parallelization of Local Search Algorithms
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Mas...