Sciweavers

337 search results - page 44 / 68
» Run-Time Methods for Parallelizing Partially Parallel Loops
Sort
View
GPEM
2002
163views more  GPEM 2002»
13 years 7 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
IPPS
2010
IEEE
13 years 5 months ago
Optimizing RAID for long term data archives
We present new methods to extend data reliability of disks in RAID systems for applications like long term data archival. The proposed solutions extend existing algorithms to detec...
Henning Klein, Jörg Keller
MOC
2002
144views more  MOC 2002»
13 years 7 months ago
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
Abstract. We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as spe...
Xue-Cheng Tai, Paul Tseng
PROCEDIA
2010
103views more  PROCEDIA 2010»
13 years 2 months ago
The Deflated Relaxed Incomplete Cholesky CG method for use in a real-time ship simulator
Ship simulators are used for training purposes and therefore have to calculate realistic wave patterns around the moving ship in real time. We consider a wave model that is based ...
E. van't Wout, M. B. van Gijzen, A. Ditzel, Auke v...
BMCBI
2008
89views more  BMCBI 2008»
13 years 7 months ago
R/parallel - speeding up bioinformatics analysis with R
Background: R is the preferred tool for statistical analysis of many bioinformaticians due in part to the increasing number of freely available analytical methods. Such methods ca...
Gonzalo Vera, Ritsert C. Jansen, Remo Suppi